2000 character limit reached
On the connection between zero-free regions and the error term in the Prime Number Theorem
Published 18 Jul 2025 in math.NT | (2507.13780v1)
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\'ev\'esz (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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.