A sequential Riesz-like criterion for the Riemann Hypothesis
From MaRDI portal
Publication:2368477
Let \(\zeta(s)\) be the Riemann zeta-function, and define the numbers \[ c_k = \sum_{j = 0}^k (-1)^j \binom kj \zeta(2j + 2)^{-1}. \] The author proves that the Riemann Hypothesis is true if and only if the numbers \(c_k\) satisfy the bounds \(c_k \ll k^{-3/4 + \varepsilon}\) for every fixed \(\varepsilon > 0\). He also proves that the stronger bound \(c_k \ll k^{-3/4}\) implies the simplicity of the zeros of \(\zeta(s)\).
Recommendations
- Riesz-type criteria for the Riemann hypothesis
- The criteria of Riesz, Hardy-Littlewood et al. for the Riemann hypothesis revisited using similar functions
- The simplest equivalent of the Riemann hypothesis
- Sufficient and equivalent criteria for the Riemann hypothesis
- Extended reciprocal zeta function and an alternate formulation of the Riemann hypothesis
Cited in
(10)- A sequence associated with the zeros of the Riemann zeta function
- On Maslanka's representation for the Riemann zeta function
- Yet another representation for reciprocals of the nontrivial zeros of the Riemann zeta function
- Extended reciprocal zeta function and an alternate formulation of the Riemann hypothesis
- The criteria of Riesz, Hardy-Littlewood et al. for the Riemann hypothesis revisited using similar functions
- Binomial polynomials mimicking Riemann's zeta function
- Riesz-type criteria for the Riemann hypothesis
- Discretized Keiper/Li approach to the Riemann hypothesis
- Hardy-Littlewood-Riesz type equivalent criteria for the generalized Riemann hypothesis
- On differences of zeta values
This page was built for publication: A sequential Riesz-like criterion for the Riemann Hypothesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368477)
