Algorithms and computation in four-dimensional topology. This project will establish Australia as a world leader in computational topology, particularly in the all-important areas of topology in three and four dimensions. In four dimensions this work will be truly groundbreaking; until now the field has seen little development due to the complexity of the algorithms and computations required, and the applicant is in the unique position of having the necessary tools to make significant progress ....Algorithms and computation in four-dimensional topology. This project will establish Australia as a world leader in computational topology, particularly in the all-important areas of topology in three and four dimensions. In four dimensions this work will be truly groundbreaking; until now the field has seen little development due to the complexity of the algorithms and computations required, and the applicant is in the unique position of having the necessary tools to make significant progress in a feasible time frame. In three dimensions this project will strengthen the distinguished computational topology community in Melbourne, led by pioneers such as Rubinstein, Goodman, Hodgson as well as the applicant himself.Read moreRead less
Dynamics of eigenvalue/eigenspace algorithms with applications to signal processing. Many problems in signal and systems lead naturally to an eigenvalue/eigenspace determination and tracking problem; for example (acoustic) echo-cancellation, crosstalk suppression in ADSL modems, direction of arrival determination with an array of sensors, linear system identification etc. Exploiting methods from global analysis and dynamical systems theory we will study the available algorithms for eigenspace de ....Dynamics of eigenvalue/eigenspace algorithms with applications to signal processing. Many problems in signal and systems lead naturally to an eigenvalue/eigenspace determination and tracking problem; for example (acoustic) echo-cancellation, crosstalk suppression in ADSL modems, direction of arrival determination with an array of sensors, linear system identification etc. Exploiting methods from global analysis and dynamical systems theory we will study the available algorithms for eigenspace determination to characterise their computational efficiency, accuracy and effectiveness in various data scenarios. The analysis will lead to improved designs for eigenvalue/eigenspace algorithms, as well as design tools to engineer algorithms to specific situations.Read moreRead less
Trisections, triangulations and the complexity of manifolds. This project aims at practical representations of 3-dimensional and 4-dimensional spaces as needed in applications. Topology is the mathematical study of the shapes of spaces. Geometry endows spaces with additional structure such as distance, angle and curvature. Special combinatorial structures, such as minimal triangulations, are often closely connected to geometric structures or topological properties. This project aims to construct ....Trisections, triangulations and the complexity of manifolds. This project aims at practical representations of 3-dimensional and 4-dimensional spaces as needed in applications. Topology is the mathematical study of the shapes of spaces. Geometry endows spaces with additional structure such as distance, angle and curvature. Special combinatorial structures, such as minimal triangulations, are often closely connected to geometric structures or topological properties. This project aims to construct computable invariants, connectivity results for triangulations, and algorithms to recognise fundamental topological properties and structures such as trisections and bundles.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE130100762
Funder
Australian Research Council
Funding Amount
$309,609.00
Summary
The interplay between structures and algorithms in combinatorial optimisation. Networks are ubiquitous in science, technology, and virtually all aspects of life. The project aims to make progress on central questions in the mathematical theory of networks. These include designing efficient algorithms for approximating the Hadwiger number, which is a key measure of the complexity of a network.
Topological containment and the Hajós Conjecture: new structure theorems from computer search. This projects aims to characterise when a network contains within it the topology, or shape, of a specific smaller network. It will develop new tools that use computer search to find such characterisations. The outcomes of this project will be used to attack one of the remaining unsolved cases of a famous conjecture dating back over sixty years.
Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unit ....Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unites geometric techniques with powerful methods from operations research, such as linear and discrete optimisation, to build fast, powerful tools that can for the first time systematically solve large topological problems. Theoretically, this project has significant impact on the famous open problem of detecting knottedness in fast polynomial time.Read moreRead less
An algebraic renaissance for the chromatic polynomial. Graph colouring started out as a recreational problem in 1852, but now has many applications including the use in timetabling, scheduling, computer science and statistical physics. This project is about counting colourings, and will develop the algebraic theory of how this is done.
Discovery Early Career Researcher Award - Grant ID: DE120101375
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
The Tutte polynomial of a graph: correlations, approximations and applications. The Tutte polynomial is a mathematical function of central importance to diverse fields of research, such as network reliability and statistical mechanics, that involve natural (and often difficult) counting problems. This project aims to obtain useful close approximations of this function with immediate applications in all these research fields.