Quantum vertex algebras. The project aims to address major mathematical problems on the structure and representations of the families of quantum groups and vertex algebras associated with Lie algebras. Originating from solvable lattice models in statistical mechanics, the theory of quantum groups has important connections with, and applications to, a wide range of subjects in mathematics and physics. The project will extend and develop explicit theory of both the classical and quantum versions o ....Quantum vertex algebras. The project aims to address major mathematical problems on the structure and representations of the families of quantum groups and vertex algebras associated with Lie algebras. Originating from solvable lattice models in statistical mechanics, the theory of quantum groups has important connections with, and applications to, a wide range of subjects in mathematics and physics. The project will extend and develop explicit theory of both the classical and quantum versions of the vertex algebras which are of importance to conformal field theory and soliton spin-chain models.Read moreRead less
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
Coarse Geometry: a novel approach to the Callias index & topological matter. Coarse geometry is the study of the large-scale structure of metric spaces, in terms of operator algebras. This project aims to use coarse geometry to develop novel approaches to Callias index theory and its applications, and to topological phases of matter, where the Nobel Prize in physics in 2016 was awarded. This will yield new techniques in index theory and other areas, and solutions to several important problems. O ....Coarse Geometry: a novel approach to the Callias index & topological matter. Coarse geometry is the study of the large-scale structure of metric spaces, in terms of operator algebras. This project aims to use coarse geometry to develop novel approaches to Callias index theory and its applications, and to topological phases of matter, where the Nobel Prize in physics in 2016 was awarded. This will yield new techniques in index theory and other areas, and solutions to several important problems. Outcomes include a noncompact generalisation of the famous Guillemin-Sternberg conjecture that quantisation commutes with reduction, and new models of topological phases of matter in terms of K-theory of operator algebras. This project will benefit Australia by reinforcing its position in these highly active areas in science.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE190100666
Funder
Australian Research Council
Funding Amount
$381,000.00
Summary
Extremal combinatorics meets finite geometry. This project aims to investigate important open problems lying at the intersection of two areas of mathematics, extremal combinatorics and finite geometry. The project will focus on the area of discrete mathematics, which has been at the centre of some of recent developments in mathematics and computer science. This project proposes new methods, derived from algebra, geometry and computer science, to tackle important extremal problems in finite geome ....Extremal combinatorics meets finite geometry. This project aims to investigate important open problems lying at the intersection of two areas of mathematics, extremal combinatorics and finite geometry. The project will focus on the area of discrete mathematics, which has been at the centre of some of recent developments in mathematics and computer science. This project proposes new methods, derived from algebra, geometry and computer science, to tackle important extremal problems in finite geometry. The project will provide answers to a number of open problems in extremal combinatorics and finite geometry. Moreover, new methods will be developed which will have an interdisciplinary impact.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
New directions in extremal and structural graph theory. This project aims to attack unsolved problems at the intersection of extremal and structural graph theory, two of the most significant branches of graph theory. Graph theory, which is the mathematics of networks, models many real-world problems and is a key component of modern mathematics. This project expects to develop a theory that synthesises the latest developments in the two fields. It is expected that the tools developed will be wide ....New directions in extremal and structural graph theory. This project aims to attack unsolved problems at the intersection of extremal and structural graph theory, two of the most significant branches of graph theory. Graph theory, which is the mathematics of networks, models many real-world problems and is a key component of modern mathematics. This project expects to develop a theory that synthesises the latest developments in the two fields. It is expected that the tools developed will be widely applicable, for example, in algorithms for network optimisation. The project will build collaborations between Australian researchers and world-leading international mathematicians, and will provide advanced training for talented young researchers.Read moreRead less
Enumeration and properties of large discrete structures. This project aims to study a fundamental property of random graphs, by further developing a recently introduced approach to the problem of enumerating graphs with given degrees. Using this new method, the project expects to generate new knowledge on the number of connections that each node has with other nodes in a random graph, and to develop new strategies for counting the graphs or networks with a given property. The project expects to ....Enumeration and properties of large discrete structures. This project aims to study a fundamental property of random graphs, by further developing a recently introduced approach to the problem of enumerating graphs with given degrees. Using this new method, the project expects to generate new knowledge on the number of connections that each node has with other nodes in a random graph, and to develop new strategies for counting the graphs or networks with a given property. The project expects to produce new theoretical results as well as enhanced capabilities of mathematical research. Potential benefits arise through the uses of these theoretical combinatorial objects to study naturally occurring networks such as social networks, the network of the world wide web, and chemical compounds.Read moreRead less
Enumeration and random generation of contingency tables with given margins. This project aims to find algorithms to construct random tables of numbers having given totals across the rows and down the columns. The aim is also to study properties of such tables. A significant aspect of the project is that it is expected to cover scenarios where all existing methods fail, by deploying recently developed powerful techniques used for random networks in combinatorics. Expected outcomes of this project ....Enumeration and random generation of contingency tables with given margins. This project aims to find algorithms to construct random tables of numbers having given totals across the rows and down the columns. The aim is also to study properties of such tables. A significant aspect of the project is that it is expected to cover scenarios where all existing methods fail, by deploying recently developed powerful techniques used for random networks in combinatorics. Expected outcomes of this project include the development of efficient algorithms that can be used in statistics for identifying relationships between variables in large data sets. This would help bring Australia to the forefront of research in an area that is significant both in data analysis and in discrete mathematics.
Read moreRead less
Triangulations: linking geometry and topology with combinatorics. Triangulations are the method of choice to represent geometric objects given by a finite sample of points. Prominent examples include the pictures produced by the finite element method, polytopes in optimisation, or surfaces in computer graphics.
Knowledge about the triangulations of an object and how they relate to each other is essential for these applications. Seemingly canonical and straightforward methods perform well - or n ....Triangulations: linking geometry and topology with combinatorics. Triangulations are the method of choice to represent geometric objects given by a finite sample of points. Prominent examples include the pictures produced by the finite element method, polytopes in optimisation, or surfaces in computer graphics.
Knowledge about the triangulations of an object and how they relate to each other is essential for these applications. Seemingly canonical and straightforward methods perform well - or not at all, depending on intricate and highly involved mathematical properties.
In this project we combine geometric and topological viewpoints to tackle high-profile questions about triangulations. This will unlock the full potential of combinatorial methods and practical algorithms in applications.Read moreRead less
A unified approach to the design of minimum length networks. This project aims to develop a new approach to designing minimum length interconnection networks by analysing their geometric structure. These networks form the basis of communication, power and transport systems. Optimising the design of such networks is a mathematically challenging problem of high computational complexity. This project will use an innovative method based on a relationship between the geometry of networks and a type o ....A unified approach to the design of minimum length networks. This project aims to develop a new approach to designing minimum length interconnection networks by analysing their geometric structure. These networks form the basis of communication, power and transport systems. Optimising the design of such networks is a mathematically challenging problem of high computational complexity. This project will use an innovative method based on a relationship between the geometry of networks and a type of partitioning of the plane called an oriented Voronoi diagram. The outcome will be efficient new algorithms for designing physical networks, which, in practice, will ultimately lead to a reduction in network infrastructure costs for industries in Australia.
Read moreRead less