ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ζ\zeta denote the Riemann zeta function, and assume the Riemann hypothesis, so that every non-trivial zero of ζ\zeta has the form 12+iγ\tfrac12 + i\gamma with γ∈R\gamma \in \mathbb{R}; below γ\gamma and γ′\gamma' always denote imaginary parts of non-trivial zeros of ζ\zeta (counted with multiplicity).

For fixed real numbers α≤β\alpha \le \beta put δ(α,β)=1\delta(\alpha,\beta) = 1 if 0∈[α,β]0 \in [\alpha,\beta] and δ(α,β)=0\delta(\alpha,\beta) = 0 otherwise. Then

lim⁡T→∞#{(γ,γ′):0<γ,γ′≤T and 2παlog⁡T≤γ−γ′≤2πβlog⁡T}T2πlog⁡T=∫αβ(1−(sin⁡(πu)πu)2)du+δ(α,β),\lim_{T\to\infty} \frac{\#\left\{(\gamma,\gamma') : 0 < \gamma, \gamma' \le T \text{ and } \dfrac{2\pi\alpha}{\log T} \le \gamma - \gamma' \le \dfrac{2\pi\beta}{\log T}\right\}}{\dfrac{T}{2\pi}\log T} = \int_{\alpha}^{\beta}\left(1 - \left(\frac{\sin(\pi u)}{\pi u}\right)^{2}\right)\mathrm{d}u + \delta(\alpha,\beta),

where the integrand is interpreted by continuity at u=0u = 0.

Equivalently, in terms of the Fourier-transform side: for T>2T > 2 and α∈R\alpha \in \mathbb{R}, with the weight w(u):=44+u2w(u) := \dfrac{4}{4+u^{2}}, set

F(α):=FT(α)=(T2πlog⁡T)−1∑0<γ,γ′≤TT iα(γ−γ′) w(γ−γ′).F(\alpha) := F_{T}(\alpha) = \left(\frac{T}{2\pi}\log T\right)^{-1} \sum_{0 < \gamma, \gamma' \le T} T^{\,i\alpha(\gamma-\gamma')}\, w(\gamma-\gamma').

Then for every A>1A > 1,

FT(α)=1+o(1),T→∞,F_{T}(\alpha) = 1 + o(1), \qquad T \to \infty,

uniformly for 1≤∣α∣≤A1 \le |\alpha| \le A.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.