Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 26, 2021 | Submitted
Report Open

The Fyodorov-Hiary-Keating Conjecture. I.

Abstract

By analogy with conjectures for random matrices, Fyodorov-Hiary-Keating and Fyodorov-Keating proposed precise asymptotics for the maximum of the Riemann zeta function in a typical short interval on the critical line. In this paper, we settle the upper bound part of their conjecture in a strong form. More precisely, we show that the measure of those T ≤ t ≤ 2T for which max_(|h|≤1|) ζ(1/2 + it +ih)| > e^y log T/((log log T)^(3/4)) is bounded by Cye^(−2y) uniformly in y ≥ 1. This is expected to be optimal for y = O(√log log T). This upper bound is sharper than what is known in the context of random matrices, since it gives (uniform) decay rates in y. In a subsequent paper we will obtain matching lower bounds.

Additional Information

The authors are grateful to Frederic Ouimet for several discussions, and to Erez Lapid and Ofer Zeitouni for their careful reading, pointing at a mistake in the initial proof of Lemma 23. The research of LPA was supported in part by NSF CAREER DMS-1653602. PB acknowledges the support of NSF grant DMS-1812114 and a Poincaré chair. MR acknowledges the support of NSF grant DMS-1902063 and a Sloan Fellowship.

Attached Files

Submitted - 2007.00988.pdf

Files

2007.00988.pdf
Files (561.7 kB)
Name Size Download all
md5:270fee551a09ebc00fb5f92f81c9e894
561.7 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 23, 2023