Related papers: Improvements to Turing's Method
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. This article improves the bound on $|\int_{t_{1}}^{t_{2}} S(t)\, dt|$ given in an earlier paper by…
We improve constants in the Rademacher-Menchov inequality.
This paper contains new explicit upper bounds for the number of zeroes of Dirichlet L-functions and Dedekind zeta-functions in rectangles.
The Riemann zeta function, and more generally the L-functions of Dirichlet characters, are among the central objects of study in number theory. We report on a project to formalize the theory of these objects in Lean's "Mathlib" library,…
The aim of this paper is to give a proof of improving of Zalcman's lemma.
Some Titchmarsh results following Gram's law are improved in this paper.
When it comes to partial numerical verification of the Riemann Hypothesis, one crucial part is to verify the completeness of a list of pre-computed zeros. Turing developed such a method, based on an explicit version of a theorem of…
This is yet another version of the course notes in chao-dyn/9407003. Here we change the universal Turing machine that is used to measure program-size complexity so that the constants in our information-theoretic incompleteness theorems are…
We derive explicit bounds for two general classes of $L$-functions, improving and generalizing earlier known estimates. These bounds can be used, for example, to apply Turing's method for determining the number of zeros up to a given…
We examine the size of $E_{2}(T)$, the error term in the asymptotic formula for $\int_{0}^{T} |\zeta(1/2 + it)|^{4}\, dt$ where $\zeta(s)$ is the Riemann zeta-function. We make improvements in the powers of $\log T$ in the known bounds for…
Under GRH, we establish a version of Duke's short-sum theorem for entire Artin $L$-functions. This yields corresponding bounds for residues of Dedekind zeta functions. All numerical constants in this work are explicit.
A new method for continuing the usual Dirichlet series that defines the Riemann zeta function ${\zeta}(s)$ is presented. Numerical experiments demonstrating the computational efficacy of the resulting continuation are discussed.
We study some of the interactions between the Fourier Transform and the Riemann zeta function (and Dirichlet-Dedekind-Hecke-Tate L-functions)
This paper contains a small improvement to the explicit bounds on the growth of the function $S(T)$. It is shown how more substantial improvements are possible if one has better explicit bounds on the growth of $|\zeta(\frac{1}{2}+it)|$.
In comparison with the previous version of this paper, the Introduction is slightly changed and some minor typos are deleted. All results are unchanged.
A short proof of the generalized Riemann hypothesis (gRH in short) for zeta functions $\zeta_{k}$ of algebraic number fields $k$ - based on the Hecke's proof of the functional equation for $\zeta_{k}$ and the method of the proof of the…
Riemann numerically approximated at least three zeta zeros. According to Edwards, Riemann even took steps to verify that the lowest zero he computed was indeed the first zeta zero. This approach to verification is developed, improved, and…
New formulas for approximation of zeta-constants were derived on the basis of a number-theoretic approach constructed for the irrationality proof of certain classical constants. Using these formulas it's possible to approximate certain…
This paper describes some validated numerics aspects of Riemann zeta function, Dirichlet L-functions, Dedekind zeta functions and Hasse-Weil L-functions.
The suggested approach is based on a known representation of Dirichlet $L$-functions via the incomplete gamma functions. Some properties of the Taylor coefficients of the lower incomplete gamma function at infinity seem to be new.…