Variants of the Selberg sieve, and bounded intervals containing many primes
Abstract
For any m ≥ 1, let Hm denote the quantity n ∞ (pn+m-pn). A celebrated recent result of Zhang showed the finiteness of H1, with the explicit bound H1 ≤ 70000000. This was then improved by us (the Polymath8 project) to H1 ≤ 4680, and then by Maynard to H1 ≤ 600, who also established for the first time a finiteness result for Hm for m ≥ 2, and specifically that Hm m3 e4m. If one also assumes the Elliott-Halberstam conjecture, Maynard obtained the bound H1 ≤ 12, improving upon the previous bound H1 ≤ 16 of Goldston, Pintz, and Yldrm, as well as the bound Hm m3 e2m. In this paper, we extend the methods of Maynard by generalizing the Selberg sieve further, and by performing more extensive numerical calculations. As a consequence, we can obtain the bound H1 ≤ 246 unconditionally, and H1 ≤ 6 under the assumption of the generalized Elliott-Halberstam conjecture. Indeed, under the latter conjecture we show the stronger statement that for any admissible triple (h1,h2,h3), there are infinitely many n for which at least two of n+h1,n+h2,n+h3 are prime. We modify the "parity problem" argument of Selberg to show that this result is the best possible that one can obtain from purely sieve-theoretic considerations. For larger m, we use the distributional results obtained previously by our project to obtain the unconditional asymptotic bound Hm m e(4-24181)m, or Hm m e2m under the assumption of the Elliott-Halberstam conjecture. We also obtain explicit upper bounds for Hm when m=2,3,4,5.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.