Counting zeros of the Riemann zeta function
Elchin Hasanalizade, Quanli Shen, Peng-Jie Wong

TL;DR
This paper provides an improved explicit bound on the number of non-trivial zeros of the Riemann zeta function up to height T, utilizing advanced bounds and techniques from related L-function studies.
Contribution
It introduces a tighter explicit bound on zero counting of the Riemann zeta function, improving upon previous results for large T.
Findings
New explicit bound with smaller constants
Utilizes subconvexity bounds and techniques from Dirichlet L-functions
Enhances previous zero counting estimates
Abstract
In this article, we show that where denotes the number of non-trivial zeros , with , of the Riemann zeta function. This improves the previous result of Trudgian for sufficiently large . The improvement comes from the use of various subconvexity bounds and ideas from the work of Bennett on counting zeros of Dirichlet -functions.
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.
