Access the full text.
Sign up today, get DeepDyve free for 14 days.
Denote by γn the positive ordinates of the non-trivial zeros of the zeta-function in ascending order. Assuming the Riemann hypothesis and conjectural asymptotic formulae for the (continuous and discrete) 2kth and 4kth moment for the zeta-function originating from random matrix theory, we prove that for any fixed positive integer r more than cN(T) (log T)−4k 2 of the ordinates γn ∈ [0, T] satisfy $$({\gamma_n+r}-\gamma_n) {{\rm log}\gamma_n \over 2\pi r} \geq \theta \ \ \ \ \ {\rm for \ any} \ \theta \leq {4k \over \pi er}$$ , where c is a computable positive constant depending on k, θ and r.
Computational Methods and Function Theory – Springer Journals
Published: May 22, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.