Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

The University of British Columbia

$55,000.00

Explicit methods in Diophantine number theory

FY 2024-25

Summary
Our proposed research lies in the area of Effective Methods for Diophantine Problems, with an emphasis on those where the techniques involved in their solution include Diophantine Approximation. The proposal focusses on applications to theoretical and computational aspects of elliptic curves, and on explicit solution of classical problems from Diophantine equations. S-unit equations are connected to a quite remarkable collection of number theoretic problems, ranging from classical Diophantine equations, to the determination of representatives of binary forms of bounded discriminant, to monogenicity of number fields, to questions in transcendental number theory. Recent work with my PhD student Bajpai and of my former student Gherga, joint with Siksek, make the solution of even quite involved S-unit equations a practical matter, within range of current technology. We will focus on norm-form equations, where the hope is to make explicit solution of such equations essentially routine.  Related to this circle of ideas, we plan to implement a Thue-Mahler "solver" over number fields, which will allow us to tabulate elliptic curves over number fields of low degree, independent of results from modularity. As with analogous work over Q, being able to tabulate all such curves of bounded conductor, over a fixed field, provides a valuable data-set for testing assorted heuristics about ranks and other arithmetic quantities. We also plan to further investigate various applications of the Wiles-Taylor method, associating classical or Hilbert modular forms to certain ternary Diophantine equations. In joint work with Siksek over the past few years, we have successfully combined this machinery with techniques from transcendental number theory and from combinatorics, to resolve a number of classical problems. We will improve and strengthen these methods, using careful analysis of reduction types of p-adic representations, restricted to decomposition subgroups, combinatorial refinements and multi-Frey techniques. This will be joint work with Freitas, and with Hajdu and his collaborators in Debrecen. Another area where we anticipate making progress is on the average behaviour of the number of solutions to Thue equations, following work of Akhtari and Bhargava. For large families of quartic Thue equations F(x,y)=m, it should be possible to combine slight generalizations of work of Alpoge and of Xiao to show that the number of solutions in coprime integers is "usually" zero. Finally, let us mention a project in analytic and computational number theory, joint with Martin and O'Bryant, where we hope to derive best possible "arithmetic" asymptotics in the study of multi-point Pade approximants to certain systems of functions (the hypergeometric method). This project will combine recent results of the proposer (joint with Martin, O'Bryant and Rechnitzer) on primes in arithmetic progressions, with arguments from Discrepancy theory.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2024-06121
Name nom
Bennett, Michael
Department département
Mathematics
Organization id
2
Institution établissement
The University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
55000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2913
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Number theory
Research subject fr
Théorie des nombres
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Explicit methods in Diophantine number theory
Keywords
diophantine approximation; diophantine equations; elliptic curves; s-unit equations; fourier coefficients of modular forms
Application summary
Our proposed research lies in the area of Effective Methods for Diophantine Problems, with an emphasis on those where the techniques involved in their solution include Diophantine Approximation. The proposal focusses on applications to theoretical and computational aspects of elliptic curves, and on explicit solution of classical problems from Diophantine equations. S-unit equations are connected to a quite remarkable collection of number theoretic problems, ranging from classical Diophantine equations, to the determination of representatives of binary forms of bounded discriminant, to monogenicity of number fields, to questions in transcendental number theory. Recent work with my PhD student Bajpai and of my former student Gherga, joint with Siksek, make the solution of even quite involved S-unit equations a practical matter, within range of current technology. We will focus on norm-form equations, where the hope is to make explicit solution of such equations essentially routine.  Related to this circle of ideas, we plan to implement a Thue-Mahler "solver" over number fields, which will allow us to tabulate elliptic curves over number fields of low degree, independent of results from modularity. As with analogous work over Q, being able to tabulate all such curves of bounded conductor, over a fixed field, provides a valuable data-set for testing assorted heuristics about ranks and other arithmetic quantities. We also plan to further investigate various applications of the Wiles-Taylor method, associating classical or Hilbert modular forms to certain ternary Diophantine equations. In joint work with Siksek over the past few years, we have successfully combined this machinery with techniques from transcendental number theory and from combinatorics, to resolve a number of classical problems. We will improve and strengthen these methods, using careful analysis of reduction types of p-adic representations, restricted to decomposition subgroups, combinatorial refinements and multi-Frey techniques. This will be joint work with Freitas, and with Hajdu and his collaborators in Debrecen. Another area where we anticipate making progress is on the average behaviour of the number of solutions to Thue equations, following work of Akhtari and Bhargava. For large families of quartic Thue equations F(x,y)=m, it should be possible to combine slight generalizations of work of Alpoge and of Xiao to show that the number of solutions in coprime integers is "usually" zero. Finally, let us mention a project in analytic and computational number theory, joint with Martin and O'Bryant, where we hope to derive best possible "arithmetic" asymptotics in the study of multi-point Pade approximants to certain systems of functions (the hypergeometric method). This project will combine recent results of the proposer (joint with Martin, O'Bryant and Rechnitzer) on primes in arithmetic progressions, with arguments from Discrepancy theory.
The University of British Columbia - $55,000 Grant (2… | Canada Spends