Variants of the Selberg sieve, and bounded intervals containing many primes
D. H. J. Polymath

TL;DR
This paper advances sieve methods to improve bounds on the minimal gaps between primes, achieving new unconditional and conditional results, and extends the understanding of prime distributions within bounded intervals.
Contribution
It generalizes the Selberg sieve and performs extensive numerical calculations to improve bounds on prime gaps, including new results under the generalized Elliott-Halberstam conjecture.
Findings
Unconditionally, H_1 246
Under the generalized Elliott-Halberstam conjecture, H_1 6
Established bounds for H_m for m=2,3,4,5
Abstract
For any , let denote the quantity . A celebrated recent result of Zhang showed the finiteness of , with the explicit bound . This was then improved by us (the Polymath8 project) to , and then by Maynard to , who also established for the first time a finiteness result for for , and specifically that . If one also assumes the Elliott-Halberstam conjecture, Maynard obtained the bound , improving upon the previous bound of Goldston, Pintz, and Y{\i}ld{\i}r{\i}m, as well as the bound . 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 unconditionally,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Limits and Structures in Graph Theory
