English

Bounding $S_n(t)$ on the Riemann hypothesis

Number Theory 2021-09-30 v1 Classical Analysis and ODEs

Abstract

Let S(t)=1πargζ(12+it)S(t) = \tfrac{1}{\pi} \arg \zeta (\frac12 + it) be the argument of the Riemann zeta-function at the point 12+it\tfrac12 + it. For n1n \geq 1 and t>0t>0 define its iterates \begin{equation*} S_n(t) = \int_0^t S_{n-1}(\tau) \,{\rm d}\tau\, + \delta_n\,, \end{equation*} where δn\delta_n is a specific constant depending on nn and S0(t):=S(t)S_0(t) := S(t). In 1924, J. E. Littlewood proved, under the Riemann hypothesis (RH), that Sn(t)=O(logt/(loglogt)n+1)S_n(t) = O(\log t/ (\log \log t)^{n+1}). The order of magnitude of this estimate was never improved up to this date. The best bounds for S(t)S(t) and S1(t)S_1(t) are currently due to Carneiro, Chandee and Milinovich. In this paper we establish, under RH, an explicit form of this estimate \begin{equation*} -\left( C^-_n + o(1)\right) \frac{\log t}{(\log \log t)^{n+1}} \ \leq \ S_n(t) \ \leq \ \left( C^+_n + o(1)\right) \frac{\log t}{(\log \log t)^{n+1}}\,, \end{equation*} for all n2n\geq 2, with the constants Cn±C_n^{\pm} decaying exponentially fast as nn \to \infty. This improves (for all n2n \geq 2) a result of Wakasa, who had previously obtained such bounds with constants tending to a stationary value when nn \to \infty. Our method uses special extremal functions of exponential type derived from the Gaussian subordination framework of Carneiro, Littmann and Vaaler for the cases when nn is odd, and an optimized interpolation argument for the cases when nn is even. In the final section we extend these results to a general class of LL-functions.

Keywords

Cite

@article{arxiv.1702.04099,
  title  = {Bounding $S_n(t)$ on the Riemann hypothesis},
  author = {Emanuel Carneiro and Andrés Chirre},
  journal= {arXiv preprint arXiv:1702.04099},
  year   = {2021}
}

Comments

23 pages. To appear in Math. Proc. Cambridge Philos. Soc

R2 v1 2026-06-22T18:17:43.916Z