Optimal bounds for sums of bounded arithmetic functions
Andr\'es Chirre, Harald Andr\'es Helfgott

TL;DR
This paper develops optimal bounds for sums of bounded arithmetic functions using spectral data from Dirichlet series, significantly improving bounds on the Mertens function and providing explicit formulas with pole contributions.
Contribution
It introduces a sharp, general method to estimate sums of bounded arithmetic functions from limited spectral data, improving bounds on M(x) and clarifying the contribution of each pole.
Findings
Stronger bounds on M(x) than previous results.
Explicit formula for M(x) with clear pole contributions.
Method combines Fourier analysis, contour-shifting, and Beurling--Selberg approximants.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Holomorphic and Operator Theory · Mathematical functions and polynomials
