Counting zeros of the Riemann zeta function
From MaRDI portal
Abstract: In this article, we show that left| N (T) - frac{T}{ 2 pi} log left( frac{T}{2pi e}
ight)
ight| le 0.1038 log T + 0.2573 loglog T + 9.3675 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.
Recommendations
Cites work
- A new upper bound for \(|\zeta(1+it)|\)
- An explicit van der Corput estimate for (1/2+it)
- An improved explicit bound on \(| \zeta(\frac{1}{2} + i t) |\)
- An improved upper bound for the argument of the Riemann zeta-function on the critical line
- An improved upper bound for the argument of the Riemann zeta-function on the critical line. II
- An improved upper bound for the error in the zero-counting formulae for Dirichlet L-functions and Dedekind zeta-functions
- Counting zeros of Dirichlet L-functions
- Explicit estimates for the Riemann zeta function
- New bounds for \psi (x)
- On the Phragmén-Lindelöf theorem and some applications
- The Riemann hypothesis is true up to 3·1012
Cited in
(16)- The mean square of the error term in the prime number theorem
- A conditional explicit result for the prime number theorem in short intervals
- A zero density result for the Riemann zeta function
- scientific article; zbMATH DE number 1064118 (Why is no real title available?)
- Counting zeros of Dedekind zeta functions
- On the imaginary part of the nontrivial zeros of the Riemann zeta function
- Primes between consecutive powers
- Sharper bounds for the Chebyshev function \(\psi(x)\)
- Explicit zero-free regions for the Riemann zeta-function
- Counting Zeros of Random Functions
- Explicit bounds on \(\zeta (s)\) in the critical strip and a zero-free region
- On a positivity property of the real part of the logarithmic derivative of the Riemann -function
- A note on the Phragmén-Lindelöf theorem
- Sharper bounds for the error in the prime number theorem assuming the Riemann hypothesis
- On the error term in the explicit formula of Riemann-von Mangoldt. II.
- Explicit bounds for the Riemann zeta-function on the 1-line
This page was built for publication: Counting zeros of the Riemann zeta function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668920)