Beurling integers with RH and large oscillation

Beurling generalized prime numbers Bohr's extremal example for convexity bound Diamond-Montgomery-Vorhauer probabilistic method generalized integers with large oscillation generalized integers with Riemann hypothesis saddle-point method

Mathematics Subject Classification ID

Nonreal zeros of (zeta (s)) and (L(s, chi)); Riemann and other hypotheses (11M26) Other Dirichlet series and zeta functions (11M41) Distribution of primes (11N05) Generalized primes and integers (11N80)

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

p i (x) = o p e r a t o r n a m e * L i (x) + O (s q r t x)

, while its integer counting function satisfies the oscillation estimate

for some

c > 0

, where

h o > 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.

Review text

Let \(N(x)\) and \(\pi(x)\) count the number of generalized integers and primes, respectively, not exceeding a given number \(x\). In the paper under review the authors prove that there exists a Beurling generalized number system such that \[ \pi(x) =Li(x)+O(\sqrt{x}), \] where \(Li\) stands for the logarithmic integral. Also, they show for any constant \(c>2\sqrt{2}\) that \[ N(x)=\rho x+\Omega_{\pm}(x\exp(-c\sqrt{\log x \log\log x}), \] where \(\rho>0\) is the asymptotic density of \(N\). The method for showing this result is first to construct a continuous analogue of a number system having the desired properties and then to find a suitable discrete approximation to it, yielding the sought discrete Beurling number system. The authors also prove that there exists an absolutely continuous prime distribution function \(\Pi_C\) with associated integer distribution function \(N_C\) such that \[ \Pi_C(x)=\int_1^x\frac{1-u^{-1}}{\log u}\,du+O(1), \] and, for any constant \(c>2\sqrt{2}\), \[ N_C(x)=\rho x+\Omega_{\pm}(x\exp(-c\sqrt{\log x \log\log x}), \] where \(\rho>0\) is the asymptotic density of \(N_C\).

Recommendations

Cites work

Cited in

(18)

This page was built for publication: Beurling integers with RH and large oscillation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189509)