Algorithmic and computational advances in geometric group theory. This project aims to combine new algorithmic ideas, high performance computing and experimental mathematics to answer many outstanding questions in the field of geometric group theory. This project will put Australia at the forefront of new computer-assisted research, and give new insights into complex mathematical problems.
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.
Discovery Early Career Researcher Award - Grant ID: DE190100888
Funder
Australian Research Council
Funding Amount
$333,924.00
Summary
Linear recurrence sequences over function fields and their applications. This project aims to deeply and systematically develop the theory of linear recurrence sequences (LRS) defined over function fields. Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science. The project is expected to expand our knowledge on LRS and will span a wide range of new research directions. Through investigating and revealing the theoretical and practical aspects of LRS over fu ....Linear recurrence sequences over function fields and their applications. This project aims to deeply and systematically develop the theory of linear recurrence sequences (LRS) defined over function fields. Linear recurrence sequences (LRS) appear almost everywhere in mathematics and computer science. The project is expected to expand our knowledge on LRS and will span a wide range of new research directions. Through investigating and revealing the theoretical and practical aspects of LRS over function fields, the project will enrich the toolkits for cybersecurity by providing new approaches to cryptography. The outcomes of the project will help position Australia as a leader in this field.Read moreRead less
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.
New Applications of Additive Combinatorics in Number Theory and Graph Theory. The project aims to advance significantly the interplay between additive combinatorics, number theory and graph theory. The project will use and advance methods and results of additive combinatorics and give new applications to such fundamental problems on Cayley graphs as connectivity, random walks, colouring and dominating sets. The significance of the project is ensured by its goal of advancing existing results and ....New Applications of Additive Combinatorics in Number Theory and Graph Theory. The project aims to advance significantly the interplay between additive combinatorics, number theory and graph theory. The project will use and advance methods and results of additive combinatorics and give new applications to such fundamental problems on Cayley graphs as connectivity, random walks, colouring and dominating sets. The significance of the project is ensured by its goal of advancing existing results and methods of additive combinatorics and also in finding their new applications that have long-lasting impact on paramount problems for Cayley graphs that underlie the architecture of crucial communication networks. Achieving progress on these problems and developing relevant methods of additive combinatorics will be the main outcomes. Read moreRead less
Additive combinatorics, arithmetic algebraic geometry and finite fields. This project aims to combine additive combinatorics and algebraic geometry and apply them to the theory of finite fields. Additive combinatorics and algebraic geometry are mostly developed over the complex numbers and other fields of characteristic zero. This project will bring the power of these different, discrete and continuous areas to finite fields, opening new perspectives for progress on several major problems, inacc ....Additive combinatorics, arithmetic algebraic geometry and finite fields. This project aims to combine additive combinatorics and algebraic geometry and apply them to the theory of finite fields. Additive combinatorics and algebraic geometry are mostly developed over the complex numbers and other fields of characteristic zero. This project will bring the power of these different, discrete and continuous areas to finite fields, opening new perspectives for progress on several major problems, inaccessible by other methods. The project will advance and affect the development of number theory research in Australia and methodologies useful in mathematics and computer science, including cryptography.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.
Symmetry and computation. The overall objective of the project is to explore connections between symmetry and computation, especially the theory and algorithms that facilitate the use of groups in computational science. The main outcome will be theoretically fast algorithms and implementations to drive applications in the sciences and for secure communication.
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.