AI & Computingarticle2026-08-15

On the connection between zero-free regions and the error term in the prime number theorem

Open access0 citations

Abstract

Abstract We provide for a wide class of zero-free regions an upper bound for the error term in the Prime Number Theorem, refining works of Pintz (1980), Johnston (2024), and Révész (2024). Our method does not only apply to the Riemann zeta function, but to general Beurling zeta functions. Next we construct Beurling zeta functions having infinitely many zeros on a prescribed contour, and none to the right, for a wide class of such contours. We also deduce an oscillation result for the corresponding error term in the Prime Number Theorem, showing that our aforementioned refinement is close to being sharp.

// Source

View paper (DOI)Open access versionOpenAlexAnalysis MathematicaPublished 2026-08-15

Authors: Frederik Broucke

Institutions: Alfréd Rényi Institute of Mathematics