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
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
Verifying the Riemann hypothesis to large heights: theory and applications. This project aims to verify the Riemann hypothesis to a record height and apply this verification to the distribution of prime numbers. The Riemann hypothesis (an open problem for 150 years) is ubiquitous in analytic number theory and prevalent in many other areas of mathematics. This project plans to use state-of-the-art computational hardware and the mathematical and algorithmic expertise of the investigators to verify ....Verifying the Riemann hypothesis to large heights: theory and applications. This project aims to verify the Riemann hypothesis to a record height and apply this verification to the distribution of prime numbers. The Riemann hypothesis (an open problem for 150 years) is ubiquitous in analytic number theory and prevalent in many other areas of mathematics. This project plans to use state-of-the-art computational hardware and the mathematical and algorithmic expertise of the investigators to verify the Riemann hypothesis several orders of magnitude further than what is currently known. A secondary aim is to apply this new verification to a multitude of results in analytic number theory: this would provide future researchers with vastly superior results.Read moreRead less
Fast algorithms for zeta functions of algebraic varieties. The project aims to develop new algorithms for counting the number of solutions to polynomial equations in several variables. This fundamental counting problem appears in many areas of mathematics and computer science, such as number theory and cryptography. The aim of the project is to develop algorithms that are more efficient and that are able to handle much larger problems than existing algorithms. The new algorithms are expected to ....Fast algorithms for zeta functions of algebraic varieties. The project aims to develop new algorithms for counting the number of solutions to polynomial equations in several variables. This fundamental counting problem appears in many areas of mathematics and computer science, such as number theory and cryptography. The aim of the project is to develop algorithms that are more efficient and that are able to handle much larger problems than existing algorithms. The new algorithms are expected to have applications to the numerical investigation of important unsolved problems in number theory, such as the Sato-Tate, Lang-Trotter and Birch-Swinnerton-Dyer conjectures.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE120101293
Funder
Australian Research Council
Funding Amount
$375,000.00
Summary
Counting solutions to equations over fields of large characteristic. This project will make major contributions to a fundamental problem in mathematics and computer science, namely counting the number of solutions to certain types of polynomial equations. This work has potential applications in computer security, information processing, and pure mathematics.
Constructive Representation Theory. A group is a mathematical structure that captures the notion of symmetry. This project will enable us to perform a deep analysis of all the ways in which the group can act on an object such as a molecule, by constructing all of its representations as a matrix group.
Interactions between non-commutative algebra and algebraic geometry. Non-commutative algebra and algebraic geometry are both classical branches of maths. Recently, there has been an explosion of research involving intriguing interactions between the two rich disciplines, driven as much by considerations of physics (for example, string theory) as by maths itself. This project forms an integral part of these developments.
Composition tree algorithms for large matrix groups. This project aims to develop new algorithms for analysing groups. A group is a rather simple mathematical structure – an example is the set of all integers considering only the operations of addition and subtraction. Since the symmetries of an object form a group, groups are ubiquitous throughout mathematics and elsewhere in science. Because it is frequently necessary to determine a group's properties, there is great interest in finding effici ....Composition tree algorithms for large matrix groups. This project aims to develop new algorithms for analysing groups. A group is a rather simple mathematical structure – an example is the set of all integers considering only the operations of addition and subtraction. Since the symmetries of an object form a group, groups are ubiquitous throughout mathematics and elsewhere in science. Because it is frequently necessary to determine a group's properties, there is great interest in finding efficient algorithms for analysing groups. A matrix group is a common type of group whose elements are square matrices. This project plans to employ a novel approach to designing algorithms for analysing large matrix groups, a task which is currently impossible using existing algorithms.Read moreRead less
Additive combinatorics of infinite sets via ergodic theoretic approach. The proposed project will utilise innovative ergodic theoretic approaches to enable us to address important questions in Additive Combinatorics (Number Theory) and Fractal Geometry. In particular, we will resolve long-standing inverse additive problems for infinite sets, discover sum-product phenomena in Number Theory, and find a plethora of finite configurations in fractal sets. We will also extend the structure theory of ....Additive combinatorics of infinite sets via ergodic theoretic approach. The proposed project will utilise innovative ergodic theoretic approaches to enable us to address important questions in Additive Combinatorics (Number Theory) and Fractal Geometry. In particular, we will resolve long-standing inverse additive problems for infinite sets, discover sum-product phenomena in Number Theory, and find a plethora of finite configurations in fractal sets. We will also extend the structure theory of one of the most popular mathematical models of quasi-crystals to a more extensive class of groups. This project will make significant contributions to Additive Combinatorics and Ergodic Theory and will bring the Australian research in these fields to ever greater heights.Read moreRead less