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.
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.
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
Elliptic special functions. Although elliptic functions and special functions are both classical areas of mathematics, the field of elliptic special functions was only established in the last two decades. It combines ideas from analysis, modular forms and statistical mechanics to tackle problems in number theory (elliptic curves), algebra (elliptic quantum groups), mathematical physics (Seiberg duality) and more. This project aims to settle two important problems in the field of elliptic special ....Elliptic special functions. Although elliptic functions and special functions are both classical areas of mathematics, the field of elliptic special functions was only established in the last two decades. It combines ideas from analysis, modular forms and statistical mechanics to tackle problems in number theory (elliptic curves), algebra (elliptic quantum groups), mathematical physics (Seiberg duality) and more. This project aims to settle two important problems in the field of elliptic special functions: the resolution of Boyd's conjectures concerning Mahler measures and L-values of elliptic curves, and the construction of an Askey-Wilson-Koorwinder theory of elliptic biorthogonal functions for the A-type root system.Read moreRead less
Matchings in Combinatorial Structures. The theory of matching in graphs concerns the problem of pairing up objects, subject to constraints on which objects may be paired. It is a well-developed theory that is not only of tremendous mathematical importance, but is also widely applied to efficiently deal with allocation and scheduling problems. Much less is known, however, about the equally important but harder problem of dividing objects into collections of three or more. This project aims to add ....Matchings in Combinatorial Structures. The theory of matching in graphs concerns the problem of pairing up objects, subject to constraints on which objects may be paired. It is a well-developed theory that is not only of tremendous mathematical importance, but is also widely applied to efficiently deal with allocation and scheduling problems. Much less is known, however, about the equally important but harder problem of dividing objects into collections of three or more. This project aims to address this deficiency by developing the theory of matching in important combinatorial objects. The problems it expects to solve are of great significance in their own right, and when considered together may help to lay a foundation for a more general theory of matching.Read moreRead less
Decompositions of graphs into cycles: Alspach's Conjecture and the Oberwolfach problem. Graph theory is used extensively to model and solve practical problems in physical, biological and social systems. By answering two long-standing and fundamental questions, the project will extend a long tradition of Australian research excellence in the field, and provide substantial high-quality postgraduate training in line with national needs.
The Oberwolfach Problem and related Graph Factorisations. Graph factorisation is an active area of research in combinatorial mathematics that is driven both by theoretical questions and by new and varied applications, particularly in digital communication and information technologies. The aim of this project is to solve the Oberwolfach Problem: a fundamental and historically significant graph factorisation question that has intrigued researchers for decades. Building on recent breakthroughs, new ....The Oberwolfach Problem and related Graph Factorisations. Graph factorisation is an active area of research in combinatorial mathematics that is driven both by theoretical questions and by new and varied applications, particularly in digital communication and information technologies. The aim of this project is to solve the Oberwolfach Problem: a fundamental and historically significant graph factorisation question that has intrigued researchers for decades. Building on recent breakthroughs, new and widely applicable graph factorisation techniques are intended to be developed. The project outcomes are expected to have ongoing influence and impact on research in the field.Read moreRead less
Factorisations of graphs. This project will investigate combinatorial structures and their connections within graph theory and design theory. These structures play roles in applications as diverse as scheduling, communications and data storage and security. Results from this project will significantly enhance Australia's excellent reputation in discrete mathematics.
Geometric evolution problems in nonlinear partial differential equations. This project aims to address important problems key to the understanding of geometric evolution equations and certain other nonlinear partial differential equations. The problems to be tackled lie in a very active area of mathematics: harmonic maps, liquid crystals and Yang-Mills theory. Special aims are to exploit new methods to settle open problems in harmonic maps and Yang-Mills equations, and to improve understanding o ....Geometric evolution problems in nonlinear partial differential equations. This project aims to address important problems key to the understanding of geometric evolution equations and certain other nonlinear partial differential equations. The problems to be tackled lie in a very active area of mathematics: harmonic maps, liquid crystals and Yang-Mills theory. Special aims are to exploit new methods to settle open problems in harmonic maps and Yang-Mills equations, and to improve understanding of practical questions such as the mathematical modelling of liquid crystals via the celebrated Ericksen-Leslie and Landau-de Gennes theories. The expected outcomes are fundamental results in mathematics, with applications in other sciences.Read moreRead less