English

Beurling integers with RH and large oscillation

Number Theory 2020-10-16 v2

Abstract

We construct a Beurling generalized number system satisfying the Riemann hypothesis and whose integer counting function displays extremal oscillation in the following sense. The prime counting function of this number system satisfies π(x)=Li(x)+O(x)\pi(x)= \operatorname*{Li} (x)+ O(\sqrt{x}), while its integer counting function satisfies the oscillation estimate N(x)=ρx+Ω±(xexp(clogxloglogx))N(x) = \rho x + \Omega_{\pm}\bigl(x\exp(-c\sqrt{\log x\log\log x})\bigr) for some c>0c>0, where ρ>0\rho>0 is its asymptotic density. The construction is inspired by a classical example of H. Bohr for optimality of the convexity bound for Dirichlet series, and combines saddle-point analysis with the Diamond-Montgomery-Vorhauer probabilistic method via random prime number system approximations.

Keywords

Cite

@article{arxiv.2004.11501,
  title  = {Beurling integers with RH and large oscillation},
  author = {Frederik Broucke and Gregory Debruyne and Jasson Vindas},
  journal= {arXiv preprint arXiv:2004.11501},
  year   = {2020}
}

Comments

31 pages, 2 figures

R2 v1 2026-06-23T15:04:01.179Z