Search arXivSearch

arXiv · 2006.04503

On the moments of the moments of $ζ(1/2+it)$

Abstract

Taking $t$ at random, uniformly from $[0,T]$, we consider the $k$th moment, with respect to $t$, of the random variable corresponding to the $2β$th moment of $ζ(1/2+ix)$ over the interval $x\in(t, t+1]$, where $ζ(s)$ is the Riemann zeta function. We call these the `moments of moments' of the Riemann zeta function, and present a conjecture for their asymptotics, when $T\to\infty$, for integer $k,β$. This is motivated by comparisons with results for the moments of moments of the characteristic polynomials of random unitary matrices and is shown to follow from a conjecture for the shifted moments of $ζ(s)$ due to Conrey, Farmer, Keating, Rubinstein, and Snaith \cite{cfkrs2}. Specifically, we prove that a function which, the shifted-moment conjecture of \cite{cfkrs2} implies, is a close approximation to the moments of moments of the zeta function does satisfy the asymptotic formula that we conjecture. We motivate as well similar conjectures for the moments of moments for other families of primitive $L$-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

E. C. Bailey, J. P. Keating. 2021-01-21. On the moments of the moments of $ζ(1/2+it)$. https://doi.org/10.1016/j.jnt.2020.12.008

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT