Elliptic Schubert Calculus. We are well placed to become one of the world's leading centers in the emerging discipline of elliptic representation theory. This proposal describes our plan of establishing a cohesive research program spanning all the different aspects of this multi-disciplinary field, which applies elliptic cohomology to geometric representation theory, enumerative geometry, integrable systems and invariants of singular varieties.
Our mathematically diverse team all have played key ....Elliptic Schubert Calculus. We are well placed to become one of the world's leading centers in the emerging discipline of elliptic representation theory. This proposal describes our plan of establishing a cohesive research program spanning all the different aspects of this multi-disciplinary field, which applies elliptic cohomology to geometric representation theory, enumerative geometry, integrable systems and invariants of singular varieties.
Our mathematically diverse team all have played key roles in the recent developments surrounding the field, and in very different capacities. This is a unique moment, where we have the chance to transform our individual research programs into a cohesive and powerful collaboration with a strong
international presence.Read moreRead less
Ubiquity of Kloosterman sums in Number Theory and Beyond. This project aims to seek new methods of investigating Kloosterman sums by
combining an algebraic geometry approach with an analytic approach to develop one
powerful, unified method. Its significance lies in expected pivotal advances towards
several fundamental problems which lie at the heart of number theory such as
the Dirichlet Divisor Problem and asymptotic formulas for moments of L-functions.
The expected outcome of the project is ....Ubiquity of Kloosterman sums in Number Theory and Beyond. This project aims to seek new methods of investigating Kloosterman sums by
combining an algebraic geometry approach with an analytic approach to develop one
powerful, unified method. Its significance lies in expected pivotal advances towards
several fundamental problems which lie at the heart of number theory such as
the Dirichlet Divisor Problem and asymptotic formulas for moments of L-functions.
The expected outcome of the project is to provide a deeper understanding of the
intriguing nature of Kloosterman sums and thus open new perspectives for
applications in analytic number theory. This will provide
substantial benefits for other areas such as cryptography by deepening our understanding of pseudorandom sequences.Read moreRead less
Connections in low-dimensional topology. This project aims to resolve important open questions in low-dimensional topology, by connecting hyperbolic geometry to invariants arising from quantum topology, cluster algebras, and spinors.
The spaces studied in this project, namely 3-manifolds and knots, arise in applications across engineering and science. The project expects to generate new insights into these spaces by applying tools connecting them to hyperbolic geometry.
Expected outcomes inclu ....Connections in low-dimensional topology. This project aims to resolve important open questions in low-dimensional topology, by connecting hyperbolic geometry to invariants arising from quantum topology, cluster algebras, and spinors.
The spaces studied in this project, namely 3-manifolds and knots, arise in applications across engineering and science. The project expects to generate new insights into these spaces by applying tools connecting them to hyperbolic geometry.
Expected outcomes include efficient techniques to compute important data about 3-manifolds and knots, particularly certain polynomials encoding geometry, and exact calculations of circle packings.
This should provide significant benefits, such as progress on difficult conjectures in hyperbolic geometry.
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
Fractional decomposition of graphs and the Nash-Williams conjecture. Nash-Williams' conjecture is a famous unsolved problem about decomposing graphs (abstract networks). Breakthrough results achieved in recent years have shown that the conjecture, along with other major graph decomposition problems, could be solved if only more were known about fractional decomposition. This project aims to clear this bottleneck to progress by dramatically expanding the state of knowledge on fractional decomposi ....Fractional decomposition of graphs and the Nash-Williams conjecture. Nash-Williams' conjecture is a famous unsolved problem about decomposing graphs (abstract networks). Breakthrough results achieved in recent years have shown that the conjecture, along with other major graph decomposition problems, could be solved if only more were known about fractional decomposition. This project aims to clear this bottleneck to progress by dramatically expanding the state of knowledge on fractional decomposition. Expected outcomes include major progress on Nash-Williams' conjecture and related graph decomposition problems. This should enhance Australia's research reputation in pure mathematics and provide benefits in downstream applications areas including statistics, data transmission, and fibre-optic networks.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