Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of British Columbia

$35,000.00

Diophantine problems : modern and classical perspectives

FY 2016-17

Summary
Diophantine problems have a classical appeal that reaches beyond research mathematics, in some cases such as Fermat's Last Theorem, even as far as popular culture. For a practising mathematician, they provide test-cases for the latest theorems and conjectures from Arithmetic and, indeed, Algebraic Geometry, for understanding the arithmetic of curves and surfaces, and for observing the interplay between analytic and algebraic techniques, between the theoretical and the computational. This proposal is focussed upon the application of three rather diverse techniques to a variety of Diophantine problems, sometimes solely, sometimes in combination; in most cases, these are classical problems that have proved particularly resilient to prior attempts via other means. Our first two techniques (lower bounds for linear forms in logarithms and the hypergeometric method of Thue and Siegel) derive from Diophantine approximation, while the third (that of Frey-Hellegouarch curves associated with modular abelian varieties) arises from the deep interconnection between Galois representations and modular forms. The problems where we intend to apply these methods range from classical Diophantine equations, through more analytic questions about gaps between k-free numbers, to problems with the flavour of additive combinatorics.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
250160-2012
Name nom
Bennett, Michael
Department département
Mathematics
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2016
Competition year année de concours
2012
Award amount
35000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
Partie
5
Nb partie
5
Application title
Diophantine problems : modern and classical perspectives
Keyword
NSERC
Application summary
Diophantine problems have a classical appeal that reaches beyond research mathematics, in some cases such as Fermat's Last Theorem, even as far as popular culture. For a practising mathematician, they provide test-cases for the latest theorems and conjectures from Arithmetic and, indeed, Algebraic Geometry, for understanding the arithmetic of curves and surfaces, and for observing the interplay between analytic and algebraic techniques, between the theoretical and the computational. This proposal is focussed upon the application of three rather diverse techniques to a variety of Diophantine problems, sometimes solely, sometimes in combination; in most cases, these are classical problems that have proved particularly resilient to prior attempts via other means. Our first two techniques (lower bounds for linear forms in logarithms and the hypergeometric method of Thue and Siegel) derive from Diophantine approximation, while the third (that of Frey-Hellegouarch curves associated with modular abelian varieties) arises from the deep interconnection between Galois representations and modular forms. The problems where we intend to apply these methods range from classical Diophantine equations, through more analytic questions about gaps between k-free numbers, to problems with the flavour of additive combinatorics.