English

The optimal Malliavin-type remainder for Beurling generalized integers

Number Theory 2024-03-29 v2 Complex Variables

Abstract

We establish the optimal order of Malliavin-type remainders in the asymptotic density approximation formula for Beurling generalized integers. Given α(0,1]\alpha\in (0,1] and c>0c>0 (with c1c\leq 1 if α=1\alpha=1), a generalized number system is constructed with Riemann prime counting function Π(x)=Li(x)+O(xexp(clogαx)+log2x), \Pi(x)= \operatorname*{Li}(x)+ O(x\exp (-c \log^{\alpha} x ) +\log_{2}x), and whose integer counting function satisfies the extremal oscillation estimate N(x)=ρx+Ω±(xexp(c(logxlog2x)αα+1)N(x)=\rho x + \Omega_{\pm}(x\exp(- c'(\log x\log_{2} x)^{\frac{\alpha}{\alpha+1}}) for any c>(c(α+1))1α+1c'>(c(\alpha+1))^{\frac{1}{\alpha+1}}, where ρ>0\rho>0 is its asymptotic density. In particular, this improves and extends upon the earlier work [Adv. Math. 370 (2020), Article 107240].

Keywords

Cite

@article{arxiv.2109.08509,
  title  = {The optimal Malliavin-type remainder for Beurling generalized integers},
  author = {Frederik Broucke and Gregory Debruyne and Jasson Vindas},
  journal= {arXiv preprint arXiv:2109.08509},
  year   = {2024}
}

Comments

27 pages

R2 v1 2026-06-24T06:04:23.547Z