A new approach to compressed sensing. Compressed sensing is an exciting new paradigm promising vastly improved signal sampling and reconstruction in a wide variety of applications including digital cameras, mobile phones and MRI machines. This project will explore a newly discovered approach to compressed sensing which uses mathematical arrays known as hash families.
Discovery Early Career Researcher Award - Grant ID: DE120100040
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Partitioning and ordering Steiner triple systems. Steiner triple systems are fundamental mathematical objects with many real-world applications. This project will develop deep new insights into these objects, resulting in systems allowing many users to simultaneously use a communication channel, and in schemes for preventing the loss of computer data due to hard disk failures.
Discovery Early Career Researcher Award - Grant ID: DE180100957
Funder
Australian Research Council
Funding Amount
$339,328.00
Summary
Partial differential equations, free boundaries and applications. This project aims to investigate fundamental problems in the analysis of partial differential equations and free boundary theory, to develop advanced mathematical theories with the possibility of important applications. The expected outcome is the establishment of a regularity and classification theory for nonlocal equations and for free boundary problems in linear and nonlinear settings. The benefit of the project lies in a concr ....Partial differential equations, free boundaries and applications. This project aims to investigate fundamental problems in the analysis of partial differential equations and free boundary theory, to develop advanced mathematical theories with the possibility of important applications. The expected outcome is the establishment of a regularity and classification theory for nonlocal equations and for free boundary problems in linear and nonlinear settings. The benefit of the project lies in a concrete advancement of the mathematical research with advantages for a deeper understanding of complex phenomena in physics and biology. Some of the problems also provide results useful for industrial applications.Read moreRead less
From quantum integrable systems to algebraic geometry and combinatorics. The purpose of this project is to investigate the deep connections that have recently emerged between the study of an area of mathematical physics (quantum integrable systems) and subjects of pure mathematics (enumerative and algebraic combinatorics, and algebraic geometry). These connections have a common root, which this project plans to reveal using novel methods coming from quantum integrability. This approach is expect ....From quantum integrable systems to algebraic geometry and combinatorics. The purpose of this project is to investigate the deep connections that have recently emerged between the study of an area of mathematical physics (quantum integrable systems) and subjects of pure mathematics (enumerative and algebraic combinatorics, and algebraic geometry). These connections have a common root, which this project plans to reveal using novel methods coming from quantum integrability. This approach is expected to illuminate these subjects leading to a new unified and interdisciplinary picture, and to resolve important open problems in the study of certain algebraic varieties and of their cohomology in the theory of symmetric functions, and related counting problems.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.
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.
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.
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
Expander graphs, isoperimetric numbers, and forwarding indices. Expanders are sparse but well connected networks. With numerous applications to modern technology, they have attracted many world leaders in mathematics and computer science. This project aims at substantial advancement on some important problems on expanders and related areas. It will put Australia at the forefront of this topical field.