Multiplicative structure of rational functions. This project aims to develop new methods of investigating fundamental number theoretic notions of torsion and multiplicative dependence between objects of great interest such as rational functions and their values. This includes investigating such celebrated objects as torsion points on elliptic curves and torsion subgroups on algebraic varieties. The goal is to develop new methods and make pivotal advances towards solving several fundamental probl ....Multiplicative structure of rational functions. This project aims to develop new methods of investigating fundamental number theoretic notions of torsion and multiplicative dependence between objects of great interest such as rational functions and their values. This includes investigating such celebrated objects as torsion points on elliptic curves and torsion subgroups on algebraic varieties. The goal is to develop new methods and make pivotal advances towards solving several fundamental problems where multiplicative dependence plays a crucial role. The expected outcome is to provide deeper understanding of the intriguing nature of torsion and multiplicative dependence and thus open new perspectives for their applications in number theory and beyond.Read moreRead less
Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and g ....Geodetic groups: foundational problems in algebra and computer science. The project aims to resolve important and longstanding open problems in Geometric Group Theory and Theoretical Computer Science. Since the 1980s researchers have conjectured that the geometric property of being geodetic is equivalent to several purely algebraic, algorithmic, and language-theoretic characterisations.
The project team's expertise in geodesic properties of groups, the interaction between formal languages and groups, and the theory of rewriting systems, together with recent breakthroughs by the team ensures that significant results can be expected.
Benefits include training research students and postdoctoral researchers in cutting-edge techniques, and advancing fundamental knowledge in mathematics and computer science.Read moreRead less
Towards the prime power conjecture. This project attacks a famous and long standing conjecture in pure mathematics that has important ramifications in many applied areas. The project aims to determine when it is possible to produce more efficient codes for electronic communication and statistically balanced designs for experiments in areas as diverse as agriculture and psychology.
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
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.
Algebraic Schubert geometry and unitary reflection groups. This project aims to generalise the recent work of Elias and Williamson to the complex case. Fundamental to the study of symmetry are the ubiquitous Coxeter groups, which have an associated set of critically important ‘Kazhdan-Lusztig polynomials’. For some Coxeter groups, these may be interpreted in terms of classical geometry, leading to deep positivity properties for their coefficients. Elias and Williamson have recently shown that th ....Algebraic Schubert geometry and unitary reflection groups. This project aims to generalise the recent work of Elias and Williamson to the complex case. Fundamental to the study of symmetry are the ubiquitous Coxeter groups, which have an associated set of critically important ‘Kazhdan-Lusztig polynomials’. For some Coxeter groups, these may be interpreted in terms of classical geometry, leading to deep positivity properties for their coefficients. Elias and Williamson have recently shown that this geometry may be simulated algebraically for any Coxeter group, so positivity for Kazhdan-Lusztig polynomials holds for all Coxeter groups. This result has explosive consequences in many areas of geometry and algebra. This project is designed to extend these results to complex unitary reflection groups, with potentially dramatic consequences in number theory, representation theory and topology.Read moreRead less
Australian Laureate Fellowships - Grant ID: FL120100125
Funder
Australian Research Council
Funding Amount
$1,796,966.00
Summary
Advances in the analysis of random structures and their applications. This project will provide new approaches, insights and results for probabilistic combinatorics. This area has contributed in exciting ways elsewhere in mathematics and provides versatile tools of widespread use in algorithmic computer science, with other applications in physics, coding theory for communications, and genetics.
Deep Learning for Graph Isomorphism: Theories and Applications. This project aims to investigate graph isomorphism, a fundamental problem in graph theory, using deep learning techniques. Solutions to graph isomorphism are in demand by researchers in many fields of science, such as biology, chemistry, computer science, and quantum computing. The project expects to advance knowledge about graph isomorphism and state-of-the-art methodologies for its applications. The expected outcomes include new t ....Deep Learning for Graph Isomorphism: Theories and Applications. This project aims to investigate graph isomorphism, a fundamental problem in graph theory, using deep learning techniques. Solutions to graph isomorphism are in demand by researchers in many fields of science, such as biology, chemistry, computer science, and quantum computing. The project expects to advance knowledge about graph isomorphism and state-of-the-art methodologies for its applications. The expected outcomes include new theoretical insights on combinatorial structures of graphs, efficient heuristic techniques for (maximum) subgraph isomorphism, and structured representation learning. The project should provide significant benefits to research in a wide range of science fields, as well as many real-world applications.Read moreRead less
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.