Grant: Discovery Grants Program - Individual
Université de Montréal
$56,000.00
Topics in analytic number theory and beyond
EF 2013-14
Résumé
In 1859 Riemann gave an identity for the number of prime numbers up to x in terms of the zeros of the Riemann zeta-function (which is the analytic continuation of a function that is ""naturally defined"" only on half of the complex plane). This compelling identity has been the basis of the study of the distribution of prime numbers ever since and all textbooks start from this perspective. Indeed before the 1949 elementary proof of the prime number theorem it was believed to be impossible to take any different approach and even after that it had seemed that other approaches are ""ad hoc"", and so limited in their applicability. Over the last decade, Soundararajan and I have been developing the notion of ""pretentiousness"" in analytic number theory, proving several open conjectures on different problems, and giving new and quite different proofs of several known theorems. From the perspective of classical analytic number theory, Linnik's Theorem, that there are small primes in every feasible arithmetic progression, is difficult and subtle to prove. In November 2009, we realized how pretentious methods give a relatively easy proof, leading to the development of the ""pretentious large sieve"" and other new techniques. This in turn has led us to realize that it may be possible to develop all of the results of basic classical analytic number theory, without ever using the zeros of zeta functions. If we can succeed this will give the first new approach to this very well explored subject since 1859! Our current goal is to give pretentious proofs of all of the results in Davenport's book, as well as (perhaps) that of Bombieri, and various quite new applications.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
36642-2011
Name nom
Granville, Andrew
Department département
Mathématiques et de statistique
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2011
Award amount
56000
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
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
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
3
Nb partie
5
Application title
Topics in analytic number theory and beyond
Keyword
NSERC
Application summary
In 1859 Riemann gave an identity for the number of prime numbers up to x in terms of the zeros of the Riemann zeta-function (which is the analytic continuation of a function that is ""naturally defined"" only on half of the complex plane). This compelling identity has been the basis of the study of the distribution of prime numbers ever since and all textbooks start from this perspective. Indeed before the 1949 elementary proof of the prime number theorem it was believed to be impossible to take any different approach and even after that it had seemed that other approaches are ""ad hoc"", and so limited in their applicability. Over the last decade, Soundararajan and I have been developing the notion of ""pretentiousness"" in analytic number theory, proving several open conjectures on different problems, and giving new and quite different proofs of several known theorems. From the perspective of classical analytic number theory, Linnik's Theorem, that there are small primes in every feasible arithmetic progression, is difficult and subtle to prove. In November 2009, we realized how pretentious methods give a relatively easy proof, leading to the development of the ""pretentious large sieve"" and other new techniques. This in turn has led us to realize that it may be possible to develop all of the results of basic classical analytic number theory, without ever using the zeros of zeta functions. If we can succeed this will give the first new approach to this very well explored subject since 1859! Our current goal is to give pretentious proofs of all of the results in Davenport's book, as well as (perhaps) that of Bombieri, and various quite new applications.