Table of Contents
Fetching ...

The optimal Malliavin-type remainder for Beurling generalized integers

Frederik Broucke, Gregory Debruyne, Jasson Vindas

Abstract

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

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 and (with if ), a generalized number system is constructed with Riemann prime counting function and whose integer counting function satisfies the extremal oscillation estimate for any , where is its asymptotic density. In particular, this improves and extends upon the earlier work [Adv. Math. 370 (2020), Article 107240].

Paper Structure

This paper contains 13 sections, 12 theorems, 149 equations.

Key Result

Theorem 1.2

We have $\beta^{\ast}(\alpha)=\alpha/(1+\alpha)$ for any $\alpha\in (0,1]$.

Theorems & Definitions (20)

  • Theorem 1.2
  • Theorem 1.3
  • Theorem 1.4
  • Lemma 2.1
  • proof
  • Lemma 3.1
  • proof
  • Lemma 3.2
  • proof
  • Lemma 3.3
  • ...and 10 more