Article
Licensed
Unlicensed
Requires Authentication
On large distances between neighbouring zeros of the Riemann zeta-function
-
R. N. Boyarinov
Published/Copyright:
October 18, 2010
Abstract
A new estimate of the number of zeros ϱn = βn + iγn of the Riemann zeta-function with ordinates γn belonging to a given interval and for which the distance to the next zero is sufficiently large in comparison with the mean value 2π(ln(γn/(2π)))–1 is obtained.
Received: 2010-02-17
Published Online: 2010-10-18
Published in Print: 2010-October
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
Articles in the same Issue
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
