Optimal bounds for sums of bounded arithmetic functions
Abstract
Let be a Dirichlet series with meromorphic continuation. Say we are given information on the poles of with for some large constant . What is the best way to use such finite spectral data to give explicit estimates on sums ? The problem of giving explicit bounds on the Mertens function illustrates how open this basic question was. Bounding might seem equivalent to estimating or the number of primes . However, we have long had fairly good explicit bounds on prime counts, while bounding remained a notoriously stubborn problem. We prove a sharp, general result on sums for bounded, giving an optimal way to use information on the poles of with and no data on the poles above. Our bounds on are stronger than previous ones by many orders of magnitude. (Similar results for are given in a companion paper.) Using rigorous residue computations by D. Platt, we obtain, for , This is a corollary of our main result, essentially an explicit formula with the contribution of each pole clearly stated; we shall discuss how this finer structure can be useful. Our proof mixes a Fourier-analytic approach in the style of Wiener--Ikehara with contour-shifting, using optimal approximants of Beurling--Selberg type (Carneiro--Littmann, 2013); for , the approximant in (Vaaler, 1985) reappears. While we proceed independently of existing explicit work on and , our method has an important step in common with work on another problem by (Ramana--Ramar\'e, 2020).
Keywords
Cite
@article{arxiv.2511.14736,
title = {Optimal bounds for sums of bounded arithmetic functions},
author = {Andrés Chirre and Harald Andrés Helfgott},
journal= {arXiv preprint arXiv:2511.14736},
year = {2025}
}
Comments
44 pages, 4 figures