Breaking barriers with large sieve inequalities

NSF Award Search · 01002526DB NSF RESEARCH & RELATED ACTIVIT · $119,000 · view on nsf.gov ↗

Abstract

This award concerns research in number theory. The study of arithmetic sequences over prime numbers and the value of L-functions have been foundational topics of research in number theory over the past two centuries. Large sieve inequalities, which estimate the number of integers which remain after removing a set of residue classes modulo certain primes, are an important tool used to tackle such problems. Often, the strength of the relevant large sieve inequality dictates the progress one can make. For instance, Kummer in the 19th century (refined later Patterson in the 20th century) predicted that an important exponential sum that arises naturally in arithmetic geometry exhibits a subtle statistical bias over the primes. This problem was studied on some of the first super computers in the 1950s and 60s. The PI and his collaborators recently explained this bias with surprising new insights on the relevant large sieve ensemble. In this project, the PI will seek to push the boundaries on large sieve inequalities for families of harmonics that are perceived right now to be "stuck", or right on the edge of current technology. The PI and collaborators will explore the potential consequences of their methods for moments and zeros of L-functions, non-vanishing of central values of L-functions, and bounds for exponential sums over primes. Broader impact of this project includes the training of students and postdocs and organizing seminars. An influential conjecture of Chowla asserts

Key facts

NSF award ID
2452303
Awardee
Georgia Tech Research Corporation (GA)
SAM.gov UEI
EMW9FC8J3HN4
PI
Alexander J Dunn
Primary program
01002526DB NSF RESEARCH & RELATED ACTIVIT
All programs
Estimated total
$119,000
Funds obligated
$119,000
Transaction type
Standard Grant
Period
08/15/2025 → 07/31/2027