Abstract
Selberg’s central limit theorem states that the values of , where τ is a uniform random variable on , are asymptotically distributed like a Gaussian random variable of mean 0 and standard deviation . It was conjectured by Radziwiłł that this distribution breaks down for values of order , where a multiplicative correction Ck would be present at level , k > 0. This constant should be the same as the one conjectured by Keating and Snaith for the leading asymptotic of the moment of ζ. In this paper, we provide numerical and theoretical evidence for this conjecture. We propose that this correction has a significant effect on the distribution of the maximum of in intervals of size . The precision of the prediction enables the numerical detection of Ck even for low T’s of order . A similar correction appears in the large deviations of the Keating–Snaith central limit theorem for the logarithm of the characteristic polynomial of a random unitary matrix, as first proved by Féray, Méliot and Nikeghbali.
2000 Mathematics Subject Classification::
Acknowledgments
We thank to M. Radziwiłł for insightful discussions and the referees for their careful reading of the first version of this article. We are also grateful to P. Bourgade and A. Nikeghbali for pointing out to us that Theorem 1.1 first appeared in [Citation16].
Declaration of Interest
No potential conflict of interest was reported by the author(s).