Quantum Spectra. Fundamental quantum processes will play a key role in emerging technologies in the twenty-first century across diverse industries including quantum information technology, quantum computers and electronics, quantum optics, nanoscale quantum microscopes and superconductor technology. Australia has a strong base of expertise in the underpinning quantum disciplines. This project in strategic basic research within mathematical physics will develop a comprehensive and consistent math ....Quantum Spectra. Fundamental quantum processes will play a key role in emerging technologies in the twenty-first century across diverse industries including quantum information technology, quantum computers and electronics, quantum optics, nanoscale quantum microscopes and superconductor technology. Australia has a strong base of expertise in the underpinning quantum disciplines. This project in strategic basic research within mathematical physics will develop a comprehensive and consistent mathematical description of quantum processes. This research will lead to a deeper understanding of quantum processes, keep Australia at the leading edge of international developments and increase Australia's capacity to develop and implement these new technologies.Read moreRead less
Energy, Cosmic Censorship and Black Hole Stability. Human progress is achieved by confronting fundamental questions, at the leading edge of knowledge. This project will lead to better understanding of space-time physics, and of the properties of singular solutions of non-linear hyperbolic equations. Such equations govern a wide range of physical phenomena, including fluid flow, weather and electromagnetic fields.
Discovery Early Career Researcher Award - Grant ID: DE210101323
Funder
Australian Research Council
Funding Amount
$345,448.00
Summary
Random tensors and random matrices: interactions and applications. This project aims at improving knowledge on probabilistic objects having applications in, for instance, mathematical-physics, statistical physics, quantum gravity and data science. In doing so, we expect to produce new mathematical results by building upon both classical approaches and innovative ones. In particular, on one hand, the extension of classical graphical methods will be developed and, on another hand, generalized prob ....Random tensors and random matrices: interactions and applications. This project aims at improving knowledge on probabilistic objects having applications in, for instance, mathematical-physics, statistical physics, quantum gravity and data science. In doing so, we expect to produce new mathematical results by building upon both classical approaches and innovative ones. In particular, on one hand, the extension of classical graphical methods will be developed and, on another hand, generalized probability theories will be used to provide new insights. The expected outcomes include a better understanding of the generic properties of quantum states. This should significantly benefit to mathematicians and physicists whose models use those objects and may impact the broader community of engineers and technicians.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE160100250
Funder
Australian Research Council
Funding Amount
$299,436.00
Summary
Advanced methods in combinatorial geometry. This project aims to harness new techniques to solve some challenging open problems related to visibility among sets of points. Combinatorial geometry is the mathematical study of the structure of arrangements of points, lines and other geometric objects in space. Many modern technologies require computation with such geometric data, from computer graphics to robotics and computer vision. Advances in the computational techniques that these technologies ....Advanced methods in combinatorial geometry. This project aims to harness new techniques to solve some challenging open problems related to visibility among sets of points. Combinatorial geometry is the mathematical study of the structure of arrangements of points, lines and other geometric objects in space. Many modern technologies require computation with such geometric data, from computer graphics to robotics and computer vision. Advances in the computational techniques that these technologies use are underpinned by mathematical theory. The last five years has seen major breakthroughs in combinatorial geometry, along with the development of ground-breaking new techniques. Solutions to current problems using these techniques are likely to lead to further theoretical advances and insights.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
Edge decomposition of dense graphs. This project aims to address the edge decomposition of dense graphs, including the Nash-Williams conjecture. Edge decomposition of graphs is important for the mathematical fields of graph theory, combinatorial design theory and finite geometry, and also has strong applications to digital communication and information technologies. It is anticipated that the project will result in methods for edge decomposition of dense graphs, the solution of famous open probl ....Edge decomposition of dense graphs. This project aims to address the edge decomposition of dense graphs, including the Nash-Williams conjecture. Edge decomposition of graphs is important for the mathematical fields of graph theory, combinatorial design theory and finite geometry, and also has strong applications to digital communication and information technologies. It is anticipated that the project will result in methods for edge decomposition of dense graphs, the solution of famous open problems, and a deeper, more cohesive understanding of edge decomposition.Read moreRead less
The Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major bre ....The Zarankiewicz problem through linear hypergraphs and designs. The Zarankiewicz problem is a famous open problem with deep connections to many different areas of mathematics. Despite continued attention from some of the world's most celebrated mathematicians, it has remained unsolved for over 70 years. This project aims to make major progress on the Zarankiewicz problem by utilising a novel approach based in the field of combinatorial design theory. This approach will leverage recent major breakthroughs in design theory concerning edge decompositions of dense hypergraphs.Read moreRead less
Hadwiger's graph colouring conjecture. Networks are a pervasive part of modern life. This project seeks to answer one of the deepest unsolved problems in the mathematics of networks, namely Hadwiger's Conjecture. This 65-year old problem suggests a sweeping generalisation of the famous map four-colour theorem, and is at the frontier of research in pure mathematics.
Extremal problems in hypergraph matchings. Matchings in hypergraphs are a way of understanding complex relationships between objects in any set. This project will develop a mathematical theory that covers both extreme and typical cases. This theory will have applications wherever hypergraphs are used as models, for example in machine learning, game theory, databases, data mining and optimisation.
Graph colouring via entropy compression. Graphs and hypergraphs are mathematical structures that model networks. Colouring graphs and hypergraphs is a key problem in many fields including scheduling, computing derivatives, cryptography, and coding theory. This project will apply a revolutionary method called "entropy compression" to produce new mathematical tools and algorithms for colouring graphs and hypergraphs. These results will have significant ramifications for the above applications, and ....Graph colouring via entropy compression. Graphs and hypergraphs are mathematical structures that model networks. Colouring graphs and hypergraphs is a key problem in many fields including scheduling, computing derivatives, cryptography, and coding theory. This project will apply a revolutionary method called "entropy compression" to produce new mathematical tools and algorithms for colouring graphs and hypergraphs. These results will have significant ramifications for the above applications, and will also be of fundamental importance in graph theory itself.Read moreRead less