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
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
Hypergraph models for complex discrete systems. This project aims to better understand the structure and properties of very large hypergraphs of various kinds. Hypergraphs are very general mathematical objects which can be used to model complex discrete systems. They arise naturally in many areas such as ecology, chemistry and computer science. Despite this, our theoretical understanding of very large, or random, hypergraphs lags far behind the intensely-studied special case of graphs. This proj ....Hypergraph models for complex discrete systems. This project aims to better understand the structure and properties of very large hypergraphs of various kinds. Hypergraphs are very general mathematical objects which can be used to model complex discrete systems. They arise naturally in many areas such as ecology, chemistry and computer science. Despite this, our theoretical understanding of very large, or random, hypergraphs lags far behind the intensely-studied special case of graphs. This project will answer many fundamental questions about large, random hypergraphs. The expected outcomes of the project also include new tools for working with hypergraphs, such as efficient algorithms for sampling hypergraphs. These outcomes will benefit researchers who use hypergraphs in their work and will enhance Australia's reputation for research in this area.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
Non-linear partial differential equations: Bubbles, layers and stability. This project aims to investigate non-linear elliptic partial differential equations in well-established models in applied sciences. The treatment of them challenges the existing mathematical theory. This project will enrich and expand the mathematical theory in semi-linear elliptic equations to understand the equations under investigation.
Singularity and regularity for Monge-Ampere type equations. The Monge-Ampere equation, as a premier nonlinear partial differential equation, arises in several areas including geometry, physics, and optimal transportation. Many important problems and applications are related to the regularity of solutions, which are obstructed by singularities. This project aims to classify the geometry of the singular sets, and to establish a comprehensive regularity theory for general Monge-Ampere type equation ....Singularity and regularity for Monge-Ampere type equations. The Monge-Ampere equation, as a premier nonlinear partial differential equation, arises in several areas including geometry, physics, and optimal transportation. Many important problems and applications are related to the regularity of solutions, which are obstructed by singularities. This project aims to classify the geometry of the singular sets, and to establish a comprehensive regularity theory for general Monge-Ampere type equations by using innovative approaches and developing cutting-edge technologies in partial differential equations. Expected outcomes include the resolution of outstanding open problems. This project will significantly enhance Australia’s leadership and expertise in a major area of mathematics and applications.Read moreRead less
Graded semisimple deformations. Recent advances in representation theory have revealed beautiful new structures in the classical representation theory of the symmetric groups and Hecke algebras. These discoveries have provided us with new algebras, the cyclotomic KLR algebras, that encode deep properties of fundamental objects in algebraic combinatorics and geometric representation theory. The cyclotomic quiver Hecke algebras are central to several open problems in mathematics but they are still ....Graded semisimple deformations. Recent advances in representation theory have revealed beautiful new structures in the classical representation theory of the symmetric groups and Hecke algebras. These discoveries have provided us with new algebras, the cyclotomic KLR algebras, that encode deep properties of fundamental objects in algebraic combinatorics and geometric representation theory. The cyclotomic quiver Hecke algebras are central to several open problems in mathematics but they are still poorly understood, with even basic properties like their dimensions being unknown. This project will establish a new framework for studying these algebras that will remove the current obstacles in this field and alllow us to prove substantial new results that advance the theory.Read moreRead less
Counting points on algebraic surfaces. This project aims to develop algorithms for calculating the number of solutions to polynomial equations and to compute zeta functions of certain types of algebraic varieties. Existing algorithms cannot solve these problems. The new algorithms will enable researchers in number theory to test and refine conjectures on generalisations of many famous problems, such as the Sato-Tate conjecture, the Lang-Trotter conjecture and the Birch-Swinnerton-Dyer conjecture ....Counting points on algebraic surfaces. This project aims to develop algorithms for calculating the number of solutions to polynomial equations and to compute zeta functions of certain types of algebraic varieties. Existing algorithms cannot solve these problems. The new algorithms will enable researchers in number theory to test and refine conjectures on generalisations of many famous problems, such as the Sato-Tate conjecture, the Lang-Trotter conjecture and the Birch-Swinnerton-Dyer conjecture. The project will also have a flow-on effect in other areas of mathematics and computer science where zeta functions play a central role, including cryptography, coding theory and mathematical physics.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE220100859
Funder
Australian Research Council
Funding Amount
$354,000.00
Summary
New techniques for exponential sums over low degree polynomials. This project aims to obtain new quantitative estimates for Weyl sums over low degree polynomials. Such estimates are fundamental to several areas of number theory. By interfacing techniques from diverse areas of mathematics, including algebraic geometry, analytic number theory, the geometry of numbers and harmonic analysis, this project will provide the first progress on estimating Weyl sums over low degree polynomials in over a ce ....New techniques for exponential sums over low degree polynomials. This project aims to obtain new quantitative estimates for Weyl sums over low degree polynomials. Such estimates are fundamental to several areas of number theory. By interfacing techniques from diverse areas of mathematics, including algebraic geometry, analytic number theory, the geometry of numbers and harmonic analysis, this project will provide the first progress on estimating Weyl sums over low degree polynomials in over a century. The expected outcomes include a deeper understanding of Weyl sums and enhanced international collaborations. Such progress will place Australia at the forefront of this important branch of number theory.Read moreRead less