The method of Pintz for the Ingham question about the connection of distribution of $\zeta$-zeros and order of the error in the PNT in the Beurling context
Szil\'ard Gy. R\'ev\'esz

TL;DR
This paper extends Pintz's method to Beurling generalized primes, establishing explicit bounds on the error term in the prime number theorem based on the zero-free regions of the associated zeta function.
Contribution
It generalizes Pintz's classical results to Beurling primes, providing explicit error estimates linked to zero-free regions of Beurling zeta functions.
Findings
If the Beurling zeta function has no zeros in a domain, the error term is tightly bounded.
Presence of zeros in the domain implies the error term exceeds a certain bound infinitely often.
Results are sharp up to an arbitrarily small epsilon.
Abstract
We prove two results, generalizing long existing knowledge regarding the classical case of the Riemann zeta function and some of its generalizations. These are concerned with the question of Ingham who asked for optimal and explicit order estimates for the error term , given any zero-free region . In the classical case essentially sharp results are due to some 40 years old work of Pintz. Here we consider a given a system of Beurling primes , the generated arithmetical semigroup and the corresponding integer counting function , and the corresponding error term in the PNT of Beurling, where is the Beurling analog of . First we prove that if the Beurling zeta function…
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
TopicsMathematical and Theoretical Analysis
