The optimal Malliavin-type remainder for Beurling generalized integers
Abstract
We establish the optimal order of Malliavin-type remainders in the asymptotic density approximation formula for Beurling generalized integers. Given α∈ (0,1] and c>0 (with c≤ 1 if α=1), a generalized number system is constructed with Riemann prime counting function (x)= *Li(x)+ O(x (-c α x ) +2x), and whose integer counting function satisfies the extremal oscillation estimate N(x)= x + (x(- c'( x2 x)αα+1) for any c'>(c(α+1))1α+1, where >0 is its asymptotic density. In particular, this improves and extends upon the earlier work [Adv. Math. 370 (2020), Article 107240].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.