Odd moments in the distribution of primes
Vivian Kuperberg
TL;DR
This work investigates odd moments of the prime-distribution in short intervals via refined control of sums of singular series. Building on Montgomery–Soundararajan’s framework, it analyzes $R_k(h)$, the sum of $k$-term singular series, and conjectures that odd $k$ yield $R_k(h) \asymp h^{(k-1)/2}(\log h)^{(k+1)/2}$, supported by numerical evidence. The paper proves a sharp upper bound for $k=3$ in the integer setting, and establishes analogous results for $k=3,5$ in the function-field setting, including a fifth-moment bound and corollaries for sums of singular series. It also provides numerical data that align with the conjectured growth rates and discusses open problems and toy models to guide future research on the delicate balance of diagonal and off-diagonal contributions in singular-series sums.
Abstract
Montgomery and Soundararajan showed that the distribution of $ψ(x+H) - ψ(x)$, for $0 \le x \le N$, is approximately normal with mean $ \sim H$ and variance $\sim H \log (N/H)$, when $N^δ \le H \le N^{1-δ}$. Their work depends on showing that sums $R_k(h)$ of $k$-term singular series are $μ_k(-h \log h + Ah)^{k/2} + O_k(h^{k/2-1/(7k) + \varepsilon})$, where $A$ is a constant and $μ_k$ are the Gaussian moment constants. We study lower-order terms in the size of these moments. We conjecture that when $k$ is odd, $R_k(h) \asymp h^{(k-1)/2}(\log h)^{(k+1)/2}$. We prove an upper bound with the correct power of $h$ when $k = 3$, and prove analogous upper bounds in the function field setting when $k =3$ and $k = 5$. We provide further evidence for this conjecture in the form of numerical computations.
