Mar 11, 2009 · This paper refines the argument of Lehman by reducing the size of the constants in Turing's method. This improvement is given in Theorem 1.

Mar 1, 2011 · In determining the number of non-trivial zeroes of the Riemann zeta-fu. £(s) in a given range, one proceeds in two stages.

Mar 1, 2011 · Analogous improvements are given for the arguments of Dirichlet L-functions and of Dedekind zeta-functions. 1. Introduction. In determining the ...

Turing's method uses explicit bounds on |∫t2t1S(t)dt| | ∫ t 1 t 2 S ( t ) d t | , where πS(t) π S ( t ) is the argument of the Riemann zeta-function.

This paper refines the argument of Lehman by reducing the size of the constants in Turing's method. This improvement is given in Theorem 1 and scope for ...

This paper refines the argument of Lehman by reducing the size of the constants in Turing's method by giving in Theorem 1 and scope for further improvements ...

This paper refines the argument of Lehman by reducing the size of the constants in Turing's method. This improvement is given in Theorem 1 and scope for ...

Mathematics of Computation · Improvements to Turing's method. HTML articles powered by AMS MathViewer · Abstract: This article improves the estimate of the size ...

Jun 13, 2014 · Abstract:Turing's method uses explicit bounds on |\int_{t_{1}}^{t_{2}} S(t)\, dt|, where \pi S(t) is the argument of the Riemann ...

Turing's method uses explicit bounds on $|\int_{t_{1}}^{t_{2}} S(t)\, dt|$, where $\pi S(t)$ is the argument of the Riemann zeta-function.