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
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
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: 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.
Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from ....Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from the field of parameterised complexity, creating powerful, practical solutions for these problems. It is expected to shed much-needed light on the vast and puzzling gap between theory and practice, and give researchers fast new software tools for large-scale experimentation and cutting-edge computer proofs.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
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.
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.
Complexity of group algorithms and statistical fingerprints of groups. This project aims to shape the next generation of efficient randomised algorithms in the field of group theory, the mathematics of symmetry. Fundamental mathematics underpins modern technological tasks such as web searches, sorting and data compression. This project aims to determine characteristic statistical fingerprints of key building-block groups. These group statistics lead to much faster procedures to essentially facto ....Complexity of group algorithms and statistical fingerprints of groups. This project aims to shape the next generation of efficient randomised algorithms in the field of group theory, the mathematics of symmetry. Fundamental mathematics underpins modern technological tasks such as web searches, sorting and data compression. This project aims to determine characteristic statistical fingerprints of key building-block groups. These group statistics lead to much faster procedures to essentially factor huge groups into smaller building-block groups in a manner akin to factoring an integer into its prime factors. The anticipated goal is to include the outcomes in publicly available symbolic algebra computer packages. As the theory of symmetry has broad applications in the mathematical and physical sciences, there is the potential for far reaching benefits.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