Skip to main content
MIT Mobile homeEvents - old home
Event Detail

MIT PDE/Analysis Seminar

Tue May 7, 2024 4:00–5:30 PM

Location

Building 2, 2-136

Description

Speaker: Larry Guth (MIT)Title: A new approach to bounding large values of Dirichlet polynomials.Abstract: Bounds for Dirichlet polynomials help to bound the number of zeroes of the Riemann zeta function in vertical strips, which is relevant to the distribution of primes in short intervals. A Dirichlet polynomial is a trigonometric polynomial of the form∑2N_{n = N} b n nitThe main question is about the size of the superlevel sets of D(t). We normalize so that the coefficients have norm at most 1, and then we study the superlevel set |D(t)| > Nσ for some exponent sigma between 1/2 and 1.For large values of sigma, Montgomery proved very strong bounds for the superlevel sets. But for sigma ≤ 3/4, the best known bounds follow from a very simple orthogonality argument (and they don't appear to be sharp). We improve the known bounds for sigma slightly less than 3/4. Work in progress. Joint with James Maynard.
  • MIT PDE/Analysis Seminar
    Speaker: Larry Guth (MIT)Title: A new approach to bounding large values of Dirichlet polynomials.Abstract: Bounds for Dirichlet polynomials help to bound the number of zeroes of the Riemann zeta function in vertical strips, which is relevant to the distribution of primes in short intervals. A Dirichlet polynomial is a trigonometric polynomial of the form∑2N_{n = N} b n nitThe main question is about the size of the superlevel sets of D(t). We normalize so that the coefficients have norm at most 1, and then we study the superlevel set |D(t)| > Nσ for some exponent sigma between 1/2 and 1.For large values of sigma, Montgomery proved very strong bounds for the superlevel sets. But for sigma ≤ 3/4, the best known bounds follow from a very simple orthogonality argument (and they don't appear to be sharp). We improve the known bounds for sigma slightly less than 3/4. Work in progress. Joint with James Maynard.