Clusters of primes revisited

Abstract

We revisit the generalized Rayleigh quotient optimization problem related to the Maynard-Tao sieve with the goal of finding a more efficient function basis. We demonstrate that a family based on products of reciprocals, previously used in asymptotic estimates for $H_m = \liminf_{n \to \infty}(p_{n+m}-p_n)$, provides results that are close to the theoretical limits of the sieve across many regimes. In particular, we establish $H_2 \leq 31 \, 140$, $H_3 \leq 2 \, 560 \, 022$, $H_4 \leq 193 \, 672 \, 056$, and $H_5 \leq 13 \, 659 \, 045 \, 840$. We also show that, as $k \to \infty$, the related variational quantity $M_k$, introduced by Maynard, satisfies the lower bound $M_k \geq \log k - 0.273572 + o(1)$.