4 papers
math.NT2026
Exponential sums over primes
James Maynard, Mayank Pandey, Maksym Radziwiłł
Let with , and , and let . We show that \[ \Bigl|\sum_{n<N}Λ(n)e(nα)\Bigr|\le N^{o(1)}\Bigl(\frac{N}{B^{1/2…
math.NT2024
On the theory of prime producing sieves
Kevin Ford, James Maynard
We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum over primes , where is an arbitrary n…
math.NT2024
New large value estimates for Dirichlet polynomials
Larry Guth, James Maynard
We prove new bounds for how often Dirichlet polynomials can take large values. This gives improved estimates for a Dirichlet polynomial of length taking values of size close to…
math.NT2024
An almost sharp quantitative version of the Duffin-Schaeffer conjecture
Dimitris Koukoulopoulos, James Maynard, Daodao Yang
We prove a quantitative version of the Duffin-Schaeffer conjecture with an almost sharp error term. Precisely, let be a function such that the series $\sum…