Bounded gaps between primes: Difference between revisions

From Polymath Wiki
Jump to navigationJump to search
 
(506 intermediate revisions by 9 users not shown)
Line 1: Line 1:
This is the home page for the Polymath8 project, which has two components:
* Polymath8a, "Bounded gaps between primes", was a project to improve the bound H=H_1 on the least gap between consecutive primes that was attained infinitely often, by developing the techniques of Zhang.  This project concluded with a bound of H = 4,680.
* Polymath8b, "Bounded intervals with many primes", was project to improve the value of H_1 further, as well as H_m (the least gap between primes with m-1 primes between them that is attained infinitely often), by combining the Polymath8a results with the techniques of Maynard. This project concluded with a bound of H=246, as well as additional bounds on H_m (see below).
== World records ==
== World records ==


* <math>H</math> is a quantity such that there are infinitely many pairs of consecutive primes of distance at most <math>H</math> apart.  Would like to be as small as possible (this is a primary goal of the Polymath8 project).
=== Current records ===
* <math>k_0</math> is a quantity such that every admissible <math>k_0</math>-tuple has infinitely many translates which each contain at least two primes.  Would like to be as small as possible.  Improvements in <math>k_0</math> lead to improvements in <math>H</math>(The relationship is roughly of the form <math>H \sim k_0 \log k_0</math>.
 
* <math>\varpi</math> is a technical parameter related to a specialized form of the [https://en.wikipedia.org/wiki/Elliott%E2%80%93Halberstam_conjecture Elliott-Halberstam conjecture]. Would like to be as large as possible.  Improvements in <math>\varpi</math> lead to improvements in <math>k_0</math>.  (The relationship is roughly of the form <math>k_0 \sim \varpi^{-3/2}</math>.)
This table lists the current best upper bounds on <math>H_m</math> - the least quantity for which it is the case that there are infinitely many intervals <math>n, n+1, \ldots, n+H_m</math> which contain <math>m+1</math> consecutive primes - both on the assumption of the Elliott-Halberstam conjecture (or more precisely, a generalization of this conjecture, formulated as Conjecture 1 in [BFI1986]), without this assumption, and without EH or the use of Deligne's theorems.  The boldface entry - the bound on <math>H_1</math> without assuming Elliott-Halberstam, but assuming the use of Deligne's theorems - is the quantity that has attracted the most attention. The conjectured value <math>H_1=2</math> for <math>H_1</math> is the twin prime conjecture.


{| border=1
{| border=1
|-
|-
!Date!!<math>\varpi</math>!! <math>k_0</math> !! <math>H</math> !! Comments
!<math>m</math>!!Conjectural!!Assuming EH!!Without EH!! Without EH or Deligne
|-
| 14 May
| 1/1,168 ([http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Zhang])
| 3,500,000 ([http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Zhang])
| 70,000,000 ([http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Zhang])
| All subsequent work is based on Zhang's breakthrough paper.
|-
| 21 May
|
|
| 63,374,611 ([http://mathoverflow.net/questions/131185/philosophy-behind-yitang-zhangs-work-on-the-twin-primes-conjecture/131354#131354 Lewko])
| Optimises Zhang's condition <math>\pi(H)-\pi(k_0) > k_0</math>; [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23439 can be reduced by 1] by parity considerations
|-
|-
| 28 May
|1
|
| 2
|  
| [http://terrytao.wordpress.com/2014/01/28/polymath8b-vii-using-the-generalised-elliott-halberstam-hypothesis-to-enlarge-the-sieve-support-yet-further/#comment-268732 6] (on GEH)
| 59,874,594 ([http://arxiv.org/abs/1305.6369 Trudgian])
[http://arxiv.org/abs/1311.4600 12] [M] (on EH only)
| Uses <math>(p_{m+1},\ldots,p_{m+k_0})</math> with <math>p_{m+1} > k_0</math>
| <B>[http://terrytao.wordpress.com/2014/02/21/polymath8b-ix-large-quadratic-programs/#comment-297456 246]</B>
| [http://terrytao.wordpress.com/2014/02/21/polymath8b-ix-large-quadratic-programs/#comment-297456 246]
|-
|-
| 30 May
|2
|
| 6
|
| [http://terrytao.wordpress.com/2014/05/17/polymath-8b-xi-finishing-up-the-paper/#comment-355656 252] (on GEH)
| 59,470,640 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/ Morrison])
[http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/#comment-261984 270] (on EH only)
58,885,998? ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23441 Tao])
| [http://terrytao.wordpress.com/2014/01/17/polymath8b-vi-a-low-dimensional-variational-problem/#comment-268356 395,106]
 
| [http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/#comment-262665 474,266]
59,093,364 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23444 Morrison])
 
57,554,086 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23448 Morrison])
| Uses <math>(p_{m+1},\ldots,p_{m+k_0})</math> and then <math>(\pm 1, \pm p_{m+1}, \ldots, \pm p_{m+k_0/2-1})</math> following [HR1973], [HR1973b], [R1974] and optimises in m
|-
|-
| 31 May
|3
|
| 8
| 2,947,442 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23460 Morrison])
| [http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/#comment-258528 52,116]
2,618,607 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23467 Morrison])
| [http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/#comment-258810 24,462,654]
| 48,112,378 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23460 Morrison])
| [http://terrytao.wordpress.com/2014/04/14/polymath8b-x-writing-the-paper-and-chasing-down-loose-ends/#comment-324263 32,285,928]
42,543,038 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23467 Morrison])
 
42,342,946 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23468 Morrison])
| Optimizes Zhang's condition <math>\omega>0</math>, and then uses an [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23465 improved bound] on <math>\delta_2</math>
|-
|-
| 1 Jun
|4
|
| 12
|
| [http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/#comments 474,266]
| 42,342,924 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23473 Tao])
| [http://terrytao.wordpress.com/2014/05/17/polymath-8b-xi-finishing-up-the-paper/#comment-357073 1,404,556,152]  
| Tiny improvement using the parity of <math>k_0</math>
| [http://terrytao.wordpress.com/2014/05/17/polymath-8b-xi-finishing-up-the-paper/#comment-357073 2,031,558,336]
|-
|-
| 2 Jun
|5
|
| 16
| 866,605 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23479 Morrison])
| [http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/#comment-259813 4,137,854]
| 13,008,612 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23479 Morrison])
| [http://terrytao.wordpress.com/2014/06/19/polymath8-wrapping-up/#comment-378098 78,602,310,160]
| Uses a [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23473 further improvement] on the quantity <math>\Sigma_2</math> in Zhang's analysis (replacing the previous bounds on <math>\delta_2</math>)
| [http://terrytao.wordpress.com/2014/04/14/polymath8b-x-writing-the-paper-and-chasing-down-loose-ends/#comment-339197 124,840,189,042]
|-
|-
| 3 Jun
|<math>m</math>
| 1/1,040? ([http://mathoverflow.net/questions/132632/tightening-zhangs-bound-closed v08ltu])
|<math>\displaystyle (1+o(1)) m \log m</math>
| 341,640 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23512 Morrison])
|<math>\displaystyle O( m e^{2m} )</math>
| 4,982,086 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23512 Morrison])
|<math>O( \exp( 3.815 m) ) [BI]</math>
4,802,222 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23516 Morrison])
|<math>O( m \exp((4 - \frac{4}{43}) m) )</math>
| Uses a [http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/ different method] to establish <math>DHL[k_0,2]</math> that removes most of the inefficiency from Zhang's method.
|}
|-
| 4 Jun
| 1/224?? ([http://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/#comment-19961 v08ltu])
1/240?? ([http://terrytao.wordpress.com/2013/06/04/online-reading-seminar-for-zhangs-bounded-gaps-between-primes/#comment-232661 v08ltu])
|
| 4,801,744 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23534 Sutherland])
4,788,240 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23543 Sutherland])
| Uses asymmetric version of the Hensley-Richards tuples
|-
| 5 Jun
|
| 34,429? ([http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/#comment-232721 Paldi]/[http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/#comment-232732 v08ltu])
34,429 ([http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/#comment-232840 Tao]/[http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/#comment-232843 v08ltu]/[http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/#comment-232877 Harcos])
| 4,725,021 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23555 Elsholtz])
4,717,560 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23562 Sutherland])


397,110? ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23563 Sutherland])
Unless listed below, all the above bounds were produced by the Polymath8 project.


4,656,298 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23566 Sutherland])
* [BI]: R. C. Baker, A. J. Irving, [http://arxiv.org/abs/1505.01815 Bounded intervals containing many primes]
* [M]: J. Maynard, [http://annals.math.princeton.edu/articles/8772 Small gaps between primes]


389,922 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23566 Sutherland])
We have been working on improving a number of other quantities, including the quantity <math>H_m</math> mentioned above:


388,310 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23571 Sutherland])
* <math>H = H_1</math> is a quantity such that there are infinitely many pairs of consecutive primes of distance at most <math>H</math> apart.  Would like to be as small as possible (this is a primary goal of the Polymath8 project). 
* <math>k_0</math> is a quantity such that every admissible <math>k_0</math>-tuple has infinitely many translates which each contain at least two primes.  Would like to be as small as possible.  Improvements in <math>k_0</math> lead to improvements in <math>H</math>.  (The relationship is roughly of the form <math>H \sim k_0 \log k_0</math>; see the page on [[finding narrow admissible tuples]].)  More recent improvements on <math>k_0</math> have come from solving a [[Selberg sieve variational problem]].
* <math>\varpi</math> is a technical parameter related to a specialized form of the [http://en.wikipedia.org/wiki/Elliott%E2%80%93Halberstam_conjecture Elliott-Halberstam conjecture].  Would like to be as large as possible.  Improvements in <math>\varpi</math> lead to improvements in <math>k_0</math>, as described in the page on [[Dickson-Hardy-Littlewood theorems]]. In more recent work, the single parameter <math>\varpi</math> is replaced by a pair <math>(\varpi,\delta)</math> (in previous work we had <math>\delta=\varpi</math>).  These estimates are obtained in turn from Type I, Type II, and Type III estimates, as described at the page on [[distribution of primes in smooth moduli]].


388,284 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23570 Castryck])
=== Timeline of bounds ===


388,248 ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23573 Sutherland])
A table of bounds as a function of time may be found at [[timeline of prime gap bounds]]. In this table, infinitesimal losses in <math>\delta,\varpi</math> are ignored.


[http://math.mit.edu/~drew/admissable.txt 388,188] ([http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23576 Sutherland])
== Polymath threads ==


387,982 ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23588 Castryck])
# [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart I just can’t resist: there are infinitely many pairs of primes at most 59470640 apart], Scott Morrison, 30 May 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/ The prime tuples conjecture, sieve theory, and the work of Goldston-Pintz-Yildirim, Motohashi-Pintz, and Zhang], Terence Tao, 3 June 2013. <I>Inactive</I>
# [http://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/ Polymath proposal: bounded gaps between primes], Terence Tao, 4 June 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/04/online-reading-seminar-for-zhangs-bounded-gaps-between-primes/ Online reading seminar for Zhang’s “bounded gaps between primes”], Terence Tao, 4 June 2013. <I>Inactive</I>
# [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/ More narrow admissible sets], Scott Morrison, 5 June 2013.  <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/08/the-elementary-selberg-sieve-and-bounded-prime-gaps/ The elementary Selberg sieve and bounded prime gaps], Terence Tao, 8 June 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/10/a-combinatorial-subset-sum-problem-associated-with-bounded-prime-gaps/ A combinatorial subset sum problem associated with bounded prime gaps], Terence Tao, 10 June 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/11/further-analysis-of-the-truncated-gpy-sieve/ Further analysis of the truncated GPY sieve], Terence Tao, 11 June 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/12/estimation-of-the-type-i-and-type-ii-sums/ Estimation of the Type I and Type II sums], Terence Tao, 12 June 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/14/estimation-of-the-type-iii-sums/ Estimation of the Type III sums], Terence Tao, 14 June 2013.  <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/18/a-truncated-elementary-selberg-sieve-of-pintz/ A truncated elementary Selberg sieve of Pintz], Terence Tao, 18 June, 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/22/bounding-short-exponential-sums-on-smooth-moduli-via-weyl-differencing/ Bounding short exponential sums on smooth moduli via Weyl differencing], Terence Tao, 22 June, 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/23/the-distribution-of-primes-in-densely-divisible-moduli/ The distribution of primes in densely divisible moduli], Terence Tao, 23 June, 2013.  <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/06/30/bounded-gaps-between-primes-polymath8-a-progress-report/ Bounded gaps between primes (Polymath8) – a progress report], Terence Tao, 30 June 2013. <I>Inactive</I>
# [http://sbseminar.wordpress.com/2013/07/02/the-quest-for-narrow-admissible-tuples/ The quest for narrow admissible tuples], Andrew Sutherland, 2 July 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/07/07/the-distribution-of-primes-in-doubly-densely-divisible-moduli/ The distribution of primes in doubly densely divisible moduli], Terence Tao, 7 July 2013. <I>Inactive</I>.
# [http://terrytao.wordpress.com/2013/07/27/an-improved-type-i-estimate/ An improved Type I estimate], Terence Tao, 27 July 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/08/17/polymath8-writing-the-paper/ Polymath8: writing the paper], Terence Tao, 17 August 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/09/02/polymath8-writing-the-paper-ii/ Polymath8: writing the paper, II], Terence Tao, 2 September 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/09/22/polymath8-writing-the-paper-iii/ Polymath8: writing the paper, III], Terence Tao, 22 September 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/10/15/polymath8-writing-the-paper-iv/ Polymath8: writing the paper, IV], Terence Tao, 15 October 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/11/17/polymath8-writing-the-first-paper-v-and-a-look-ahead/ Polymath8: Writing the first paper, V, and a look ahead], Terence Tao, 17 November 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/11/19/polymath8b-bounded-intervals-with-many-primes-after-maynard/ Polymath8b: Bounded intervals with many primes, after Maynard], Terence Tao, 19 November 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/11/22/polymath8b-ii-optimising-the-variational-problem-and-the-sieve/ Polymath8b, II: Optimising the variational problem and the sieve] Terence Tao, 22 November 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/12/08/polymath8b-iii-numerical-optimisation-of-the-variational-problem-and-a-search-for-new-sieves/ Polymath8b, III: Numerical optimisation of the variational problem, and a search for new sieves], Terence Tao, 8 December 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2013/12/20/polymath8b-iv-enlarging-the-sieve-support-more-efficient-numerics-and-explicit-asymptotics/ Polymath8b, IV: Enlarging the sieve support, more efficient numerics, and explicit asymptotics], Terence Tao, 20 December 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/01/08/polymath8b-v-stretching-the-sieve-support-further/ Polymath8b, V: Stretching the sieve support further], Terence Tao, 8 January 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/01/17/polymath8b-vi-a-low-dimensional-variational-problem/ Polymath8b, VI: A low-dimensional variational problem], Terence Tao, 17 January 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/01/28/polymath8b-vii-using-the-generalised-elliott-halberstam-hypothesis-to-enlarge-the-sieve-support-yet-further/ Polymath8b, VII: Using the generalised Elliott-Halberstam hypothesis to enlarge the sieve support yet further], Terence Tao, 28 January 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/02/07/new-equidistribution-estimates-of-zhang-type-and-bounded-gaps-between-primes-and-a-retrospective/ “New equidistribution estimates of Zhang type, and bounded gaps between primes” – and a retrospective], Terence Tao, 7 February 2013. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/02/09/polymath8b-viii-time-to-start-writing-up-the-results/ Polymath8b, VIII: Time to start writing up the results?], Terence Tao, 9 February 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/02/21/polymath8b-ix-large-quadratic-programs/ Polymath8b, IX: Large quadratic programs], Terence Tao, 21 February 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/04/14/polymath8b-x-writing-the-paper-and-chasing-down-loose-ends/ Polymath8b, X: Writing the paper, and chasing down loose ends], Terence Tao, 14 April 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/05/17/polymath-8b-xi-finishing-up-the-paper/ Polymath 8b, XI: Finishing up the paper], Terence Tao, 17 May 2014.<I>Inactive</I>
# [http://terrytao.wordpress.com/2014/06/19/polymath8-wrapping-up/ Polymath8: wrapping up], Terence Tao, 19 June 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/07/20/variants-of-the-selberg-sieve-and-bounded-intervals-containing-many-primes/ Variants of the Selberg sieve, and bounded intervals containing many primes], Terence Tao, 21 July 2014. <I>Inactive</I>
# [http://terrytao.wordpress.com/2014/09/30/the-bounded-gaps-between-primes-polymath-project-a-retrospective/ The "bounded gaps between primes" Polymath project - a retrospective], Terence Tao, 30 September 2014.  <B>Active</B>


387,974 ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23591 Castryck])
== Writeup ==


| k_0 bound uses the optimal Bessel function cutoff. Originally only provisional due to neglect of the kappa error, but then it was confirmed that the kappa error was within the allowed tolerance.
* Files for the submitted paper for the Polymath8a project may be found in [https://www.dropbox.com/sh/0xb4xrsx4qmua7u/AABLbLyNrYktSuGsKsXjfu37a/Revised%20version this directory].
H bound obtained by a hybrid Schinzel/greedy (or "greedy-greedy") sieve  
** The compiled PDF for this paper is available [https://www.dropbox.com/sh/0xb4xrsx4qmua7u/AAAFh3ElzOp6jrt0MtLyQ01ca/Revised%20version/newgap.pdf here].
** The paper is now on the arXiv as "[http://arxiv.org/abs/1402.0811 New equidistribution estimates of Zhang type]".
** An older unabridged version of the paper may be found [http://arxiv.org/abs/1402.0811v2 here].
** The initial referee report is [https://www.dropbox.com/sh/0xb4xrsx4qmua7u/AAANw1yXYBckm0Ao9aQEe-lKa/report1C.pdf here]. 
** The paper has appeared at Algebra & Number Theory 8-9 (2014), 2067--2199.
* Files for the draft paper for the Polymath8 retrospective may be found in [https://www.dropbox.com/sh/koxbhwvw1ysybk9/AAB1IAAjsb9kpyilhVRLLvH5a this directory].
** The compiled PDF for this paper is available [https://www.dropbox.com/sh/koxbhwvw1ysybk9/AADTJ4w3yegvgTut_Tsv0Sana/retrospective.pdf here].
** The paper is now on the arXiv as [http://arxiv.org/abs/1409.8361 "The "bounded gaps between primes" Polymath project - a retrospective]".
** The paper has appeared at [https://www.ems-ph.org/journals/newsletter/pdf/2014-12-94.pdf Newsletter of the European Mathematics Society, December 2014, issue 94, 13--23].
* Files for the draft paper for the Polymath8b project may be found in [https://www.dropbox.com/sh/uyph1zjpcirtp9b/AAC-b6Eo8GRpUHlWsC-UlKuxa this directory].
** The compiled PDF for this paper is available [https://www.dropbox.com/s/85pt6mvzf5ghukw/newergap-submitted.pdf here].
** The paper is now on the arXiv as [http://arxiv.org/abs/1407.4897 Variants of the Selberg sieve, and bounded intervals containing many primes]
** The paper is published at [http://www.resmathsci.com/content/1/1/12 Research in the Mathematical Sciences 2014, 1:12].


|-
Here are the [[Polymath8 grant acknowledgments]].
| 6 Jun
|
|
| 387,960 ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23598 Angelveit])
[http://math.mit.edu/~drew/admissable_34429_387910.txt 387,910] ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23599 Sutherland])


387,904 ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23602 Angeltveit])
== Code and data ==


[http://math.mit.edu/~drew/admissable_34429_387814.txt 387,814] ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23605 Sutherland])
* [https://github.com/semorrison/polymath8 Hensely-Richards sequences], Scott Morrison
 
** [http://tqft.net/misc/finding%20k_0.nb A mathematica notebook for finding k_0], Scott Morrison
[http://math.mit.edu/~drew/admissable_34429_387766.txt 387,766] ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23608 Sutherland])
** [https://github.com/avi-levy/dhl python implementation], Avi Levy
 
* [http://www.opertech.com/primes/k-tuples.html k-tuple pattern data], Thomas J Engelsma
[http://math.mit.edu/~drew/admissable_34429_387754.txt 387,754] ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23613 Sutherland])
** [https://perswww.kuleuven.be/~u0040935/k0graph.png A graph of this data]
 
** [http://www.opertech.com/primes/webdata/ Tuples giving this data]
[http://math.mit.edu/~drew/admissable_34429_387620.txt 387,620] ([http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23652 Sutherland])
* [https://github.com/vit-tucek/admissible_sets Sifted sequences], Vit Tucek
 
* [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23555 Other sifted sequences], Christian Elsholtz
 
* [http://www.ams.org/journals/mcom/2001-70-236/S0025-5718-01-01348-5/S0025-5718-01-01348-5.pdf Size of largest admissible tuples in intervals of length up to 1050], Clark and Jarvis
| Experimentation with different residue classes and different intervals
* [http://math.mit.edu/~drew/admissible_v0.1.tar C implementation of the "greedy-greedy" algorithm], Andrew Sutherland
|}
* [https://www.dropbox.com/sh/jjxi0jmcskx1xcz/iBBVwZTj-x Dropbox for sequences], pedant
 
* [https://docs.google.com/spreadsheet/ccc?key=0Ao3urQ79oleSdEZhRS00X1FLQjM3UlJTZFRqd19ySGc&usp=sharing Spreadsheet for admissible sequences], Vit Tucek
? - unconfirmed or conditional
* [http://www.cs.cmu.edu/~xfxie/project/admissible/admissibleV1.1.zip Java code for optimising a given tuple V1.1], xfxie
* [https://math.mit.edu/~primegaps/MaynardMathematicaNotebook.txt Mathematica Notebook for optimising M_k], James Maynard
* Some [[notes on polytope decomposition]]
* [https://math.mit.edu/~drew/ompadm_v0.5.tar Multi-threaded admissibility testing for very large tuples], Andrew Sutherland
* [http://users.ugent.be/~ibogaert/KrylovMk/KrylovMk.pdf Krylov method for lower bounding M_k], Ignace Bogaert


?? - theoretical limit of an analysis, rather than a claimed record
=== Tuples applet ===


== Benchmarks ==
Here is [https://math.mit.edu/~primegaps/sieve.html?ktuple=632 a small javascript applet] that illustrates the process of sieving for an admissible 632-tuple of diameter 4680 (the sieved residue classes match the example in the paper when translated to [0,4680]).


Let H be the minimal diameter of an admissible tuple of cardinality <math>k_0 = 34,429</math>. For benchmark upper bounds:
The same applet [https://math.mit.edu/~primegaps/sieve.html can also be used to interactively create new admissible tuples]. The default sieve interval is [0,400], but you can change the diameter to any value you like by adding “?d=nnnn” to the URL (e.g. use https://math.mit.edu/~primegaps/sieve.html?d=4680 for diameter 4680). The applet will highlight a suggested residue class to sieve in green (corresponding to a greedy choice that doesn’t hit the end points), but you can sieve any classes you like.


* The Zhang sieve (as optimized by Trudgian and later Morrison) [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23613 gives] <math>H \leq 411,932</math>.
You can also create sieving demos similar to the k=632 example above by specifying a list of residues to sieve. A longer but equivalent version of the “?ktuple=632″ URL is
* The Hensley-Richards sieve [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23633 gives] <math>H \leq 402,790</math> after optimization. 
* The shifted Hensley-Richards sieve [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23636 gives] <math>H \leq 401,700</math> after optimization.


For benchmark lower bounds:
https://math.mit.edu/~primegaps/sieve.html?d=4680&r=1,1,4,3,2,8,2,14,13,8,29,31,33,28,6,49,21,47,58,35,57,44,1,55,50,57,9,91,87,45,89,50,16,19,122,114,151,66


* The easier version of the Montgomery-Vaughan large sieve inequality <math>k_0 \sum_{q \leq Q} \frac{\mu^2(q)}{\phi(q)}) \leq H+1+Q^2</math> [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23621 gives] <math>H \geq 196,729</math>.
The numbers listed after “r=” are residue classes modulo increasing primes 2,3,5,7,, omitting any classes that do not require sieving — the applet will automatically skip such primes (e.g. it skips 151 in the k=632 example).
* The Montgomery-Vaughan Brun-Titchmarsh bound <math>k_0 \leq \frac{2(H+1)}{\log(H+1)}</math> [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23611 gives] <math>H \geq 211,046</math>.
* The Montgomery-Vaughan large sieve inequality [MV1973, Corollary 1] [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23634 gives] <math>H \geq 226,987</math> after optimization. 
* Using a refinement of this inequality [B1995, p.162] [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23641 improves this] to <math>H \geq 227,078</math>.
* A further (unpublished) refinement [http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bams/1183540922 due to Selberg] [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/#comment-23648 increases this to] <math>H \geq 234,322</math>, and conjecturally to <math>H \geq 234,642</math>.


== Polymath threads ==
A few caveats: You will want to run this on a PC with a reasonably wide display (say 1360 or greater), and it has only been tested on the current versions of Chrome and Firefox.


* [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart I just can’t resist: there are infinitely many pairs of primes at most 59470640 apart], Scott Morrison, 30 May 2013 <B>Inactive</B>
== Errata ==
* [http://terrytao.wordpress.com/2013/06/03/the-prime-tuples-conjecture-sieve-theory-and-the-work-of-goldston-pintz-yildirim-motohashi-pintz-and-zhang/ The prime tuples conjecture, sieve theory, and the work of Goldston-Pintz-Yildirim, Motohashi-Pintz, and Zhang], Terence Tao, 3 June 2013. <B>Active</B>
* [http://polymathprojects.org/2013/06/04/polymath-proposal-bounded-gaps-between-primes/ Polymath proposal: bounded gaps between primes], Terence Tao, 4 June 2013. <B>Active</B>
* [http://terrytao.wordpress.com/2013/06/04/online-reading-seminar-for-zhangs-bounded-gaps-between-primes/ Online reading seminar for Zhang’s “bounded gaps between primes], Terence Tao, 4 June 2013. <B>Active</B>
* [http://sbseminar.wordpress.com/2013/06/05/more-narrow-admissible-sets/ More narrow admissible sets], Scott Morrison, 5 June 2013.  <B>Active</B>


== Code and data ==
Page numbers refer to the file linked to for the relevant paper.


* [https://github.com/semorrison/polymath8 Hensely-Richards sequences], Scott Morrison
# Errata for Zhang's "[http://annals.math.princeton.edu/2014/179-3/p07 Bounded gaps between primes]"
** [http://tqft.net/misc/finding%20k_0.nb A mathematica notebook for finding k_0], Scott Morrison
## Page 5: In the first display, <math>\mathcal{E}</math> should be multiplied by <math>\mathcal{L}^{2k_0+2l_0}</math>, because <math>\lambda(n)^2</math> in (2.2) can be that large, cf. (2.4).
** [https://github.com/avi-levy/dhl python implementation], Avi Levy
## Page 14: In the final display, the constraint <math>(n,d_1=1</math> should be <math>(n,d_1)=1</math>.
* [http://www.opertech.com/primes/k-tuples.html k-tuple pattern data], Thomas J Engelsma
## Page 35: In the display after (10.5), the subscript on <math>{\mathcal J}_i</math> should be deleted.
* [https://github.com/vit-tucek/admissible_sets Sifted sequences], Vit Tucek
## Page 36: In the third display, a factor of <math>\tau(q_0r)^{O(1)}</math> may be needed on the right-hand side (but is ultimately harmless).
* [http://sbseminar.wordpress.com/2013/05/30/i-just-cant-resist-there-are-infinitely-many-pairs-of-primes-at-most-59470640-apart/#comment-23555 Other sifted sequences], Christian Elsholtz
## Page 38: In the display after (10.14), <math>\xi(r,a;q_1,b_1;q_2,b_2;n,k)</math> should be <math>\xi(r,a;k;q_1,b_1;q_2,b_2;n)</math>.
* [http://www.ams.org/journals/mcom/2001-70-236/S0025-5718-01-01348-5/S0025-5718-01-01348-5.pdf Size of largest admissible tuples in intervals of length up to 1050], Clark and Jarvis
## Page 42: In (12.3), <math>B</math> should probably be 2.
* [http://math.mit.edu/~drew/admissable_v0.1.tar C implementation of the "greedy-greedy" algorithm], Andrew Sutherland
## Page 47: In the third display after (13.13), the condition <math>l \in {\mathcal I}_i(h)</math> should be <math>l \in {\mathcal I}_i(sh)</math>.
## Page 49: In the top line, a comma in <math>(h_1,h_2;,n_1,n_2)</math> should be deleted.
## Page 51: In the penultimate display, one of the two consecutive commas should be deleted.
## Page 54: Three displays before (14.17), <math>\bar{r_2}(m_1+m_2)q</math> should be <math>\bar{r_2}(m_1+m_2)/q</math>.
# Errata for Motohashi-Pintz's "[http://arxiv.org/pdf/math/0602599v1.pdf A smoothed GPY sieve]", version 1.  Update: the errata below have been corrected in the most recent arXiv version of the paper.
## Page 31: The estimation of (5.14) by (5.15) does not appear to be justified.  In the text, it is claimed that the second summation in (5.14) can be treated by a variant of (4.15); however, whereas (5.14) contains a factor of <math>(\log \frac{R}{|D|})^{2\ell+1}</math>, (4.15) contains instead a factor of <math>(\log \frac{R/w}{|K|})^{2\ell+1}</math> which is significantly smaller (K in (4.15) plays a similar role to D in (5.14)).  As such, the crucial gain of <math>\exp(-k\omega/3)</math> in (4.15) does not seem to be available for estimating the second sum in (5.14).
# Errata for Pintz's "[http://arxiv.org/pdf/1306.1497v1.pdf A note on bounded gaps between primes]", version 1.  Update: the errata below have been corrected in subsequent versions of Pintz's paper.
## Page 7: In (2.39), the exponent of <math>3a/2</math> should instead be <math>-5a/2</math> (it comes from dividing (2.38) by (2.37)). This impacts the numerics for the rest of the paper.
## Page 8: The "easy calculation" that the relative error caused by discarding all but the smooth moduli appears to be unjustified, as it relies on the treatment of (5.14) in Motohashi-Pintz which has the issue pointed out in 2.1 above.


== Other relevant blog posts ==
== Other relevant blog posts ==
Line 172: Line 191:
* [http://blogs.ethz.ch/kowalski/2013/06/04/bounded-gaps-between-primes-some-grittier-details/ Bounded gaps between primes: some grittier details], Emmanuel Kowalski, 4 June 2013.
* [http://blogs.ethz.ch/kowalski/2013/06/04/bounded-gaps-between-primes-some-grittier-details/ Bounded gaps between primes: some grittier details], Emmanuel Kowalski, 4 June 2013.
** [http://www.math.ethz.ch/~kowalski/zhang-notes.pdf The slides from the talk mentioned in that post]
** [http://www.math.ethz.ch/~kowalski/zhang-notes.pdf The slides from the talk mentioned in that post]
* [http://aperiodical.com/2013/06/bound-on-prime-gaps-bound-decreasing-by-leaps-and-bounds/ Bound on prime gaps bound decreasing by leaps and bounds], Christian Perfect, 8 June 2013.
* [http://blogs.ams.org/blogonmathblogs/2013/06/14/narrowing-the-gap/ Narrowing the Gap], Brie Finegold, AMS Blog on Math Blogs, 14 June 2013.
* [http://blogs.ethz.ch/kowalski/2013/06/22/bounded-gaps-between-primes-the-dawn-of-some-enlightenment/ Bounded gaps between primes: the dawn of (some) enlightenment], Emmanuel Kowalski, 22 June 2013.
* [http://blogs.ethz.ch/kowalski/2013/06/25/a-ternary-divisor-variation/ A ternary divisor variation], Emmanuel Kowalski, 25 June 2013.
* [http://blogs.ethz.ch/kowalski/2013/09/09/conductors-of-one-variable-transforms-of-trace-functions/ Conductors of one-variable transforms of trace functions], Emmanuel Kowalski, 9 September 2013.
* [http://gilkalai.wordpress.com/2013/09/20/polymath-8-a-success/ Polymath 8 – a Success!], Gil Kalai, 20 September 2013.
* [http://blogs.ethz.ch/kowalski/2013/10/24/james-maynard-auteur-du-theoreme-de-lannee/ James Maynard, auteur du théorème de l’année], Emmanuel Kowalski, 24 October 2013.
* [http://blogs.ethz.ch/kowalski/2013/12/08/reflections-on-reading-the-polymath8a-paper/ Reflections on reading the Polymath8(a) paper], Emmanuel Kowalski, 8 December 2013.


== MathOverflow ==
== MathOverflow ==
Line 182: Line 209:
* [http://mathoverflow.net/questions/132731/does-zhangs-theorem-generalize-to-3-or-more-primes-in-an-interval-of-fixed-len Does Zhang’s theorem generalize to 3 or more primes in an interval of fixed length?], 3 June 2013.
* [http://mathoverflow.net/questions/132731/does-zhangs-theorem-generalize-to-3-or-more-primes-in-an-interval-of-fixed-len Does Zhang’s theorem generalize to 3 or more primes in an interval of fixed length?], 3 June 2013.


== Wikipedia ==
== Wikipedia and other references ==


* [http://en.wikipedia.org/wiki/Bessel_function Bessel function]
* [http://en.wikipedia.org/wiki/Bombieri-Vinogradov_theorem Bombieri-Vinogradov theorem]
* [http://en.wikipedia.org/wiki/Brun%E2%80%93Titchmarsh_theorem Brun-Titchmarsh theorem]
* [http://en.wikipedia.org/wiki/Brun%E2%80%93Titchmarsh_theorem Brun-Titchmarsh theorem]
* [http://www.encyclopediaofmath.org/index.php/Dispersion_method Dispersion method]
* [http://en.wikipedia.org/wiki/Prime_gap Prime gap]
* [http://en.wikipedia.org/wiki/Prime_gap Prime gap]
* [http://en.wikipedia.org/wiki/Second_Hardy%E2%80%93Littlewood_conjecture Second Hardy-Littlewood conjecture]
* [http://en.wikipedia.org/wiki/Second_Hardy%E2%80%93Littlewood_conjecture Second Hardy-Littlewood conjecture]
Line 192: Line 222:


* [http://arxiv.org/abs/1304.3199 On the exponent of distribution of the ternary divisor function], Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, 11 Apr 2013.
* [http://arxiv.org/abs/1304.3199 On the exponent of distribution of the ternary divisor function], Étienne Fouvry, Emmanuel Kowalski, Philippe Michel, 11 Apr 2013.
* [http://www.renyi.hu/~revesz/ThreeCorr0grey.pdf On the optimal weight function in the Goldston-Pintz-Yildirim method for finding small gaps between consecutive primes], Bálint Farkas, János Pintz and Szilárd Gy. Révész, To appear in: Paul Turán Memorial Volume: Number Theory, Analysis and Combinatorics, de Gruyter, Berlin, 2013. 23 pages.  
* [http://www.renyi.hu/~revesz/ThreeCorr0grey.pdf On the optimal weight function in the Goldston-Pintz-Yildirim method for finding small gaps between consecutive primes], Bálint Farkas, János Pintz and Szilárd Gy. Révész, To appear in: Paul Turán Memorial Volume: Number Theory, Analysis and Combinatorics, de Gruyter, Berlin, 2013. 23 pages. [http://arxiv.org/abs/1306.2133 arXiv]
* [http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Bounded gaps between primes], Yitang Zhang, to appear, Annals of Mathematics. Released 21 May, 2013.
* [http://arxiv.org/abs/1305.0348 The existence of small prime gaps in subsets of the integers], Jacques Benatar, 2 May, 2013.
* [http://annals.math.princeton.edu/2014/179-3/p07 Bounded gaps between primes], Yitang Zhang, Annals of Mathematics 179 (2014), 1121-1174. Released 21 May, 2013.
* [http://arxiv.org/abs/1305.6289 Polignac Numbers, Conjectures of Erdös on Gaps between Primes, Arithmetic Progressions in Primes, and the Bounded Gap Conjecture], Janos Pintz, 27 May 2013.
* [http://arxiv.org/abs/1305.6289 Polignac Numbers, Conjectures of Erdös on Gaps between Primes, Arithmetic Progressions in Primes, and the Bounded Gap Conjecture], Janos Pintz, 27 May 2013.
* [http://arxiv.org/abs/1305.6369 A poor man's improvement on Zhang's result: there are infinitely many prime gaps less than 60 million], T. S. Trudgian, 28 May 2013.
* [http://arxiv.org/abs/1305.6369 A poor man's improvement on Zhang's result: there are infinitely many prime gaps less than 60 million], T. S. Trudgian, 28 May 2013.
* [http://www.math.ethz.ch/~kowalski/friedlander-iwaniec-sum.pdf The Friedlander-Iwaniec sum], É. Fouvry, E. Kowalski, Ph. Michel., May 2013.
* [http://www.math.ethz.ch/~kowalski/friedlander-iwaniec-sum.pdf The Friedlander-Iwaniec sum], É. Fouvry, E. Kowalski, Ph. Michel., May 2013.
* [http://www.aimath.org/news/primegaps70m/ Zhang's Theorem on Bounded Gaps Between Primes], Dan Goldston, May? 2013.
* [http://terrytao.files.wordpress.com/2013/06/bounds.pdf Notes on Zhang's prime gaps paper], Terence Tao, 1 June 2013.
* [http://terrytao.files.wordpress.com/2013/06/bounds.pdf Notes on Zhang's prime gaps paper], Terence Tao, 1 June 2013.
* [http://arxiv.org/abs/1306.0511 Bounded prime gaps in short intervals], Johan Andersson, 3 June 2013.
* [http://arxiv.org/abs/1306.0511 Bounded prime gaps in short intervals], Johan Andersson, 3 June 2013.
* [http://arxiv.org/abs/1306.0948 Bounded length intervals containing two primes and an almost-prime II], James Maynard, 5 June 2013.
* [http://arxiv.org/abs/1306.0948 Bounded length intervals containing two primes and an almost-prime II], James Maynard, 5 June 2013.
* [http://arxiv.org/abs/1306.1497 A note on bounded gaps between primes], Janos Pintz, 6 June 2013.
* [https://sites.google.com/site/avishaytal/files/Primes.pdf Lower Bounds for Admissible k-tuples], Avishay Tal, 15 June 2013.
* Notes in a truncated elementary Selberg sieve ([http://terrytao.files.wordpress.com/2013/06/file-1.pdf Section 1], [http://terrytao.files.wordpress.com/2013/06/file-2.pdf Section 2], [http://terrytao.files.wordpress.com/2013/06/file-3.pdf Section 3]), Janos Pintz, 18 June 2013.
* [http://www.renyi.hu/~gharcos/gaps.pdf Lecture notes: bounded gaps between primes], Gergely Harcos, 1 Oct 2013.
* [http://math.mit.edu/~drew/PrimeGaps.pdf New bounds on gaps between primes], Andrew Sutherland, 17 Oct 2013.
* [http://www.dms.umontreal.ca/~andrew/CurrentEventsArticle.pdf Bounded gaps between primes], Andrew Granville, 29 Oct 2013.
* [http://www.dms.umontreal.ca/~andrew/CEBBrochureFinal.pdf Primes in intervals of bounded length], Andrew Granville, 19 Nov 2013.  [http://arxiv.org/abs/1410.8400 Uploaded to arXiv], 30 Oct 2014.
* [http://annals.math.princeton.edu/articles/8772 Small gaps between primes], James Maynard, 19 Nov 2013.  To appear, Annals Math.
* [http://arxiv.org/abs/1311.5319 A note on the theorem of Maynard and Tao], Tristan Freiberg, 21 Nov 2013.
* [http://arxiv.org/abs/1311.7003 Consecutive primes in tuples],  William D. Banks, Tristan Freiberg, and Caroline L. Turnage-Butterbaugh, 27 Nov 2013.
* [http://arxiv.org/abs/1312.2926 Close encounters among the primes], John Friedlander, Henryk Iwaniec, 10 Dec 2013.
* [http://arxiv.org/abs/1401.7555 A Friendly Intro to Sieves with a Look Towards Recent Progress on the Twin Primes Conjecture], David Lowry-Duda, 25 Jan, 2014.
* [http://arxiv.org/abs/1401.6614 The twin prime conjecture], Yoichi Motohashi, 26 Jan 2014.
* [http://arxiv.org/abs/1401.6677 Bounded gaps between primes in Chebotarev sets], Jesse Thorner, 26 Jan 2014.
* [http://arxiv.org/abs/1402.4849 Bounded gaps between primes], Ben Green, 19 Feb 2014.
* [http://arxiv.org/abs/1403.4527 Bounded gaps between primes of the special form], Hongze Li, Hao Pan, 19 Mar 2014.
* [http://arxiv.org/abs/1403.5808 Bounded gaps between primes in number fields and function fields], Abel Castillo, Chris Hall, Robert J. Lemke Oliver, Paul Pollack, Lola Thompson, 23 Mar 2014.
* [http://arxiv.org/abs/1404.4007 Bounded gaps between primes with a given primitive root], Paul Pollack, 15 Apr 2014.
* [http://arxiv.org/abs/1404.5094 On limit points of the sequence of normalized prime gaps], William D. Banks, Tristan Freiberg, and James Maynard, 21 Apr 2014.
* [http://smf4.emath.fr/Publications/Gazette/2014/140/smf_gazette_140_19-31.pdf Petits écarts entre nombres premiers et polymath : une nouvelle manière de faire de la recherche en mathématiques?], R. de la Breteche, Gazette des Mathématiciens, Soc. Math. France, Avril 2014, 19--31.
* [http://arxiv.org/abs/1405.2593 Dense clusters of primes in subsets], James Maynard, 11 May 2014.
* [http://arxiv.org/abs/1405.4444 Arithmetic functions at consecutive shifted primes], Paul Pollack, Lola Thompson, 17 May 2014.
* [http://arxiv.org/abs/1406.2658 On the ratio of consecutive gaps between primes], Janos Pintz, 10 Jun 2014.
* [http://arxiv.org/abs/1407.1747 Bounded gaps between primes in special sequences], Lynn Chua, Soohyun Park, Geoffrey D. Smith, 8 Jul 2014.
* [http://arxiv.org/abs/1407.2213 On the distribution of gaps between consecutive primes], Janos Pintz, 8 Jul 2014 (first version), 24 Sep 2014 (second version).
* [http://arxiv.org/abs/1408.5110 Large gaps between primes], James Maynard, 21 Aug 2014.
* [http://arxiv.org/abs/1410.8198 Best possible densities of Dickson m-tuples, as a consequence of Zhang-Maynard-Tao], Andrew Granville, Daniel M. Kane, Dimitris Koukoulopoulos, Robert J. Lemke Oliver, 29 Oct, 2014.
* [http://arxiv.org/abs/1411.2989 Gaps between Primes in Beatty Sequences], Roger Baker, Liangyi Zhao, 11 Nov 2014.
* [http://arxiv.org/abs/1501.06690 On the Density of Weak Polignac Numbers], Stijn Hanson, 27 Jan 2015.
* [http://arxiv.org/abs/1504.06860 On a conjecture of Erdős, Pólya and Turán on consecutive gaps between primes], Janos Pintz, 26 Apr 2015.
* [http://arxiv.org/abs/1505.01815 Bounded intervals containing many primes], R. C. Baker, A. J. Irving, 7 May 2015.
* [http://arxiv.org/abs/1505.03104 Goldbach versus de Polignac numbers], Jacques Benatar, 12 May 2015.
* [http://www.ams.org/notices/201506/rnoti-p660.pdf Prime numbers: A much needed gap is finally found], John Friedlander, June 2015.
* [http://math.mit.edu/~drew/PrimeGapsOberwolfach1.pdf Sieve theory and small gaps between primes: Introduction], [http://math.mit.edu/~drew/PrimeGapsOberwolfach2.pdf A variational problem], [http://math.mit.edu/~drew/PrimeGapsOberwolfach3.pdf Narrow admissible tuples]  Andrew V. Sutherland, July 2015.
* "Small gaps between the set of primes and products of two primes", Keiju Sono, August 2015.
* [http://arxiv.org/abs/1509.01564 Patterns of primes in arithmetic progressions], Janos Pintz, 4 Sep 2015.
* [http://arxiv.org/abs/1510.04577 A note on the distribution of normalized prime gaps], Janos Pintz, 15 Oct 2015.
* [http://arxiv.org/abs/1510.08054 Limit points and long gaps between primes], Roger Baker, Tristan Freiberg, 27 Oct 2015.
* [http://www.mast.queensu.ca/~akshaa/gaussian.pdf Bounded gaps between Gaussian primes], Akshaa Vatwani, 3 Nov 2015.
* [http://arxiv.org/abs/1512.01470 General divisor functions in arithmetic progressions to large moduli], Fei Wei, Boqing Xue, Yitang Zhang, Dec 2015.
* [http://arxiv.org/abs/1512.03936 Large gaps between consecutive primes containing perfect k-th powers of prime numbers], Helmut Maier, Michael Rassias, 12 Dec 2015.
* [http://arxiv.org/abs/1604.01761 Increasing and decreasing prime gaps], Daniel Shiu, 6 Apr 2016.
* [http://arxiv.org/abs/1604.06903 Golomb's conjecture on prime gaps], Christian Elsholtz, 23 Apr 2016.
* Factors of Carmichael numbers and a weak k-tuples conjecture, Thomas Wright, J. Aust. Math. Soc. 100 (2016), 421-429.
* [https://arxiv.org/abs/1605.02920 Small gaps between the set of products of at most two primes], Keiju Sono, May 10 2016.
* [http://arxiv.org/abs/1607.03887 Bounded Gaps Between Products of Distinct Primes], Yang Liu, Peter S. Park, Zhuo Qun Song, Jul 14 2016.
* [https://arxiv.org/abs/1705.08034 Bounded gaps between primes and the length spectra of arithmetic hyperbolic 3-orbifolds], Benjamin Linowitz, D. B. McReynolds, Paul Pollack, Lola Thompson, May 24, 2017.
* [https://arxiv.org/abs/1707.05437 Bounded gaps between primes in short intervals], Ryan Alweiss, Sammy Luo, Jul 18 2017.
* [https://arxiv.org/abs/1711.01949 Bounded gaps between product of two primes in number fields], Pranendu Darbar, Anirban Mukhopadhyay, Nov 6 2017.
* [http://arxiv.org/abs/1802.10327 Short intervals containing a prescribed number of primes], Daniele Mastrostefano, Mar 1 2018.
* [http://arxiv.org/abs/1806.09034 Almost primes in various settings], Paweł Lewulis, Jun 23 2018.
* [https://arxiv.org/abs/1907.02246 On the largest square divisor of shifted primes], Jori Merikoski, Jul 4 2019.


== Media ==
== Media ==
Line 209: Line 293:
* [http://www.slate.com/articles/health_and_science/do_the_math/2013/05/yitang_zhang_twin_primes_conjecture_a_huge_discovery_about_prime_numbers.html The Beauty of Bounded Gaps], Jordan Ellenberg, Slate, 22 May 2013.
* [http://www.slate.com/articles/health_and_science/do_the_math/2013/05/yitang_zhang_twin_primes_conjecture_a_huge_discovery_about_prime_numbers.html The Beauty of Bounded Gaps], Jordan Ellenberg, Slate, 22 May 2013.
* [http://www.newscientist.com/article/dn23644 Game of proofs boosts prime pair result by millions], Jacob Aron, New Scientist, 4 June 2013.
* [http://www.newscientist.com/article/dn23644 Game of proofs boosts prime pair result by millions], Jacob Aron, New Scientist, 4 June 2013.
* [http://www.lemonde.fr/sciences/article/2013/06/24/l-union-fait-la-force-des-mathematiciens_3435624_1650684.html L'union fait la force des mathématiciens], Philippe Pajot, Le Monde, 24 June, 2013.
* [http://blogs.discovermagazine.com/crux/2013/07/10/primal-madness-mathematicians-hunt-for-twin-prime-numbers/ Primal Madness: Mathematicians’ Hunt for Twin Prime Numbers], Amir Aczel, Discover Magazine, 10 July, 2013.
* [http://nautil.us/issue/5/fame/the-twin-prime-hero The Twin Prime Hero], Michael Segal, Nautilus, Issue 005, 2013.
* [http://news.anu.edu.au/2013/11/19/prime-time/ Prime Time], Casey Hamilton, Australian National University, 19 November 2013.
* [https://www.simonsfoundation.org/quanta/20131119-together-and-alone-closing-the-prime-gap/ Together and Alone, Closing the Prime Gap], Erica Klarreich, Quanta, 19 November 2013.
** The article also appeared on Wired as "[http://www.wired.com/wiredscience/2013/11/prime/ Sudden Progress on Prime Number Problem Has Mathematicians Buzzing]".
** [http://science.slashdot.org/story/13/11/20/1256229/mathematicians-team-up-to-close-the-prime-gap Mathematicians Team Up To Close the Prime Gap], Slashdot, 20 November 2013.
* [http://www.spektrum.de/alias/mathematik/ein-grosser-schritt-zum-beweis-der-primzahlzwillingsvermutung/1216488 Ein großer Schritt zum Beweis der Primzahlzwillingsvermutung], Hans Engler, Spektrum, 13 December 2013.
* [http://phys.org/news/2014-01-mathematical-puzzle-unraveled.html An old mathematical puzzle soon to be unraveled?], Benjamin Augereau, Phys.org, 15 January 2014.
* [http://www.spektrum.de/alias/zahlentheorie/neuer-durchbruch-auf-dem-weg-zur-primzahlzwillingsvermutung/1222001 Neuer Durchbruch auf dem Weg zur Primzahlzwillingsvermutung], Christoph Poppe, Spektrum, 30 January 2014.
* [http://news.cnet.com/8301-17938_105-57618696-1/yitang-zhang-a-prime-number-proof-and-a-world-of-persistence/ Yitang Zhang: A prime-number proof and a world of persistence], Leslie Katz, CNET, February 12, 2014.
* [http://podacademy.org/podcasts/maths-isnt-standing-still/ Maths isn’t standing still], Adam Smith and Vicky Neale, Pod Academy, March 3, 2014.
* [https://www.quantamagazine.org/20141210-prime-gap-grows-after-decades-long-lull/ Prime Gap Grows After Decades-Long Lull], Erica Klarreich, Quanta, Dec 10, 2014.
* [http://www.zalafilms.com/films/countingindex.html Counting from infinity: Yitang Zhang and the twin prime conjecture] (Documentary), George Csicsery, released Jan 2015.
* [http://www.newyorker.com/magazine/2015/02/02/pursuit-beauty The Pursuit of Beauty], Alec Wilkinson, New Yorker, Feb 2 2015.
** [http://video.newyorker.com/watch/annals-of-ideas-yitang-zhang-s-discovery-2015-01-28 Yitang Zhang's discovery] (Video), Alec Wilkinson, New Yorker, Jan 28, 2015.
* [http://digitaleditions.walsworthprintgroup.com/publication/?i=247647&p=16 Prime Progress Invigorates Math Minds], Katherine Merow, MAA Focus, February/March 2015.
* [http://www.ams.org/notices/201506/rnoti-p660.pdf Prime Numbers: A Much Needed Gap Is Finally Found], John Friedlander, Notices of the AMS, June/July 2015.


== Bibliography ==
== Bibliography ==
Line 221: Line 323:
* [FI1981] Fouvry, E.; Iwaniec, H. On a theorem of Bombieri-Vinogradov type., Mathematika 27 (1980), no. 2, 135–152 (1981). [http://www.ams.org/mathscinet-getitem?mr=610700 MathSciNet] [http://www.math.ethz.ch/~kowalski/fouvry-iwaniec-on-a-theorem.pdf Article]  
* [FI1981] Fouvry, E.; Iwaniec, H. On a theorem of Bombieri-Vinogradov type., Mathematika 27 (1980), no. 2, 135–152 (1981). [http://www.ams.org/mathscinet-getitem?mr=610700 MathSciNet] [http://www.math.ethz.ch/~kowalski/fouvry-iwaniec-on-a-theorem.pdf Article]  
* [FI1983] Fouvry, E.; Iwaniec, H. Primes in arithmetic progressions. Acta Arith. 42 (1983), no. 2, 197–218. [http://www.ams.org/mathscinet-getitem?mr=719249 MathSciNet] [http://matwbn.icm.edu.pl/ksiazki/aa/aa42/aa4226.pdf Article]
* [FI1983] Fouvry, E.; Iwaniec, H. Primes in arithmetic progressions. Acta Arith. 42 (1983), no. 2, 197–218. [http://www.ams.org/mathscinet-getitem?mr=719249 MathSciNet] [http://matwbn.icm.edu.pl/ksiazki/aa/aa42/aa4226.pdf Article]
* [FI1985] Friedlander, John B.; Iwaniec, Henryk, Incomplete Kloosterman sums and a divisor problem.  With an appendix by Bryan J. Birch and Enrico Bombieri. Ann. of Math. (2) 121 (1985), no. 2, 319–350. [http://www.ams.org/mathscinet-getitem?mr=786351 MathSciNet] [http://www.jstor.org/stable/1971175 JSTOR]  
* [FI1985] Friedlander, John B.; Iwaniec, Henryk, Incomplete Kloosterman sums and a divisor problem.  With an appendix by Bryan J. Birch and Enrico Bombieri. Ann. of Math. (2) 121 (1985), no. 2, 319–350. [http://www.ams.org/mathscinet-getitem?mr=786351 MathSciNet] [http://www.jstor.org/stable/1971175 JSTOR] [http://www.jstor.org/stable/1971176 Appendix]
* [GPY2009] Goldston, Daniel A.; Pintz, János; Yıldırım, Cem Y. Primes in tuples. I. Ann. of Math. (2) 170 (2009), no. 2, 819–862.  [http://arxiv.org/abs/math/0508185 arXiv] [http://www.ams.org/mathscinet-getitem?mr=2552109 MathSciNet]
* [GPY2009] Goldston, Daniel A.; Pintz, János; Yıldırım, Cem Y. Primes in tuples. I. Ann. of Math. (2) 170 (2009), no. 2, 819–862.  [http://arxiv.org/abs/math/0508185 arXiv] [http://www.ams.org/mathscinet-getitem?mr=2552109 MathSciNet]
* [GR1998] Gordon, Daniel M.; Rodemich, Gene Dense admissible sets. Algorithmic number theory (Portland, OR, 1998), 216–225, Lecture Notes in Comput. Sci., 1423, Springer, Berlin, 1998. [http://www.ams.org/mathscinet-getitem?mr=1726073 MathSciNet] [http://www.ccrwest.org/gordon/ants.pdf Article]
* [GR1998] Gordon, Daniel M.; Rodemich, Gene Dense admissible sets. Algorithmic number theory (Portland, OR, 1998), 216–225, Lecture Notes in Comput. Sci., 1423, Springer, Berlin, 1998. [http://www.ams.org/mathscinet-getitem?mr=1726073 MathSciNet] [http://www.ccrwest.org/gordon/ants.pdf Article]
* [GR1980] S. W. Graham, C. J. Ringrose, Lower bounds for least quadratic nonresidues. Analytic number theory (Allerton Park, IL, 1989), 269–309, Progr. Math., 85, Birkhäuser Boston, Boston, MA, 1990. [http://www.ams.org/mathscinet-getitem?mr=1084186 MathSciNet] [http://link.springer.com/content/pdf/10.1007%2F978-1-4612-3464-7_18.pdf Article]
* [HB1978] D. R. Heath-Brown, Hybrid bounds for Dirichlet L-functions. Invent. Math. 47 (1978), no. 2, 149–170. [http://www.ams.org/mathscinet-getitem?mr=485727 MathSciNet] [http://link.springer.com/article/10.1007%2FBF01578069 Article]
* [HB1986] D. R. Heath-Brown, The divisor function d3(n) in arithmetic progressions.  Acta Arith. 47 (1986), no. 1, 29–56. [http://www.ams.org/mathscinet-getitem?mr=866901 MathSciNet] [http://matwbn.icm.edu.pl/ksiazki/aa/aa47/aa4713.pdf Article]
* [HR1973] Hensley, Douglas; Richards, Ian, On the incompatibility of two conjectures concerning primes. Analytic number theory (Proc. Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, Mo., 1972), pp. 123–127. Amer. Math. Soc., Providence, R.I., 1973. [http://www.ams.org/mathscinet-getitem?mr=340194 MathSciNet] [http://www.ams.org/journals/bull/1974-80-03/S0002-9904-1974-13434-8/S0002-9904-1974-13434-8.pdf Article]
* [HR1973] Hensley, Douglas; Richards, Ian, On the incompatibility of two conjectures concerning primes. Analytic number theory (Proc. Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, Mo., 1972), pp. 123–127. Amer. Math. Soc., Providence, R.I., 1973. [http://www.ams.org/mathscinet-getitem?mr=340194 MathSciNet] [http://www.ams.org/journals/bull/1974-80-03/S0002-9904-1974-13434-8/S0002-9904-1974-13434-8.pdf Article]
* [HR1973b] Hensley, Douglas; Richards, Ian, Primes in intervals.  Acta Arith. 25 (1973/74), 375–391. [http://www.ams.org/mathscinet-getitem?mr=396440 MathSciNet] [https://eudml.org/doc/205282 Article]
* [HR1973b] Hensley, Douglas; Richards, Ian, Primes in intervals.  Acta Arith. 25 (1973/74), 375–391. [http://www.ams.org/mathscinet-getitem?mr=396440 MathSciNet] [https://eudml.org/doc/205282 Article]
* [MP2008] Motohashi, Yoichi; Pintz, János A smoothed GPY sieve. Bull. Lond. Math. Soc. 40 (2008), no. 2, 298–310.  [http://arxiv.org/abs/math/0602599 arXiv] [http://www.ams.org/mathscinet-getitem?mr=2414788 MathSciNet]
* [MP2008] Motohashi, Yoichi; Pintz, János A smoothed GPY sieve. Bull. Lond. Math. Soc. 40 (2008), no. 2, 298–310.  [http://arxiv.org/abs/math/0602599 arXiv] [http://www.ams.org/mathscinet-getitem?mr=2414788 MathSciNet] [http://blms.oxfordjournals.org/content/40/2/298 Article]
* [MV1973] Montgomery, H. L.; Vaughan, R. C. The large sieve. Mathematika 20 (1973), 119–134. [http://www.ams.org/mathscinet-getitem?mr=374060 MathSciNet] [http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=6718308 Article]
* [MV1973] Montgomery, H. L.; Vaughan, R. C. The large sieve. Mathematika 20 (1973), 119–134. [http://www.ams.org/mathscinet-getitem?mr=374060 MathSciNet] [http://journals.cambridge.org/action/displayAbstract?fromPage=online&aid=6718308 Article]
* [M1978] Hugh L. Montgomery, The analytic principle of the large sieve. Bull. Amer. Math. Soc. 84 (1978), no. 4, 547–567. [http://www.ams.org/mathscinet-getitem?mr=466048 MathSciNet] [http://projecteuclid.org/DPubS?service=UI&version=1.0&verb=Display&handle=euclid.bams/1183540922 Article]
* [R1974] Richards, Ian On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem. Bull. Amer. Math. Soc. 80 (1974), 419–438.  [http://www.ams.org/mathscinet-getitem?mr=337832 MathSciNet] [http://www.ams.org/journals/bull/1974-80-03/S0002-9904-1974-13434-8/home.html Article]
* [R1974] Richards, Ian On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem. Bull. Amer. Math. Soc. 80 (1974), 419–438.  [http://www.ams.org/mathscinet-getitem?mr=337832 MathSciNet] [http://www.ams.org/journals/bull/1974-80-03/S0002-9904-1974-13434-8/home.html Article]
* [S1961] Schinzel, A. Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers". Acta Arith. 7 1961/1962 1–8. [http://www.ams.org/mathscinet-getitem?mr=130203 MathSciNet] [http://matwbn.icm.edu.pl/ksiazki/aa/aa7/aa711.pdf Article]
* [S1961] Schinzel, A. Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers". Acta Arith. 7 1961/1962 1–8. [http://www.ams.org/mathscinet-getitem?mr=130203 MathSciNet] [http://matwbn.icm.edu.pl/ksiazki/aa/aa7/aa711.pdf Article]
* [S2007] K. Soundararajan, Small gaps between prime numbers: the work of Goldston-Pintz-Yıldırım. Bull. Amer. Math. Soc. (N.S.) 44 (2007), no. 1, 1–18. [http://www.ams.org/mathscinet-getitem?mr=2265008 MathSciNet] [http://www.ams.org/journals/bull/2007-44-01/S0273-0979-06-01142-6/ Article] [http://arxiv.org/abs/math/0605696 arXiv]
* [S2007] K. Soundararajan, Small gaps between prime numbers: the work of Goldston-Pintz-Yıldırım. Bull. Amer. Math. Soc. (N.S.) 44 (2007), no. 1, 1–18. [http://www.ams.org/mathscinet-getitem?mr=2265008 MathSciNet] [http://www.ams.org/journals/bull/2007-44-01/S0273-0979-06-01142-6/ Article] [http://arxiv.org/abs/math/0605696 arXiv]

Latest revision as of 07:51, 11 July 2019

This is the home page for the Polymath8 project, which has two components:

  • Polymath8a, "Bounded gaps between primes", was a project to improve the bound H=H_1 on the least gap between consecutive primes that was attained infinitely often, by developing the techniques of Zhang. This project concluded with a bound of H = 4,680.
  • Polymath8b, "Bounded intervals with many primes", was project to improve the value of H_1 further, as well as H_m (the least gap between primes with m-1 primes between them that is attained infinitely often), by combining the Polymath8a results with the techniques of Maynard. This project concluded with a bound of H=246, as well as additional bounds on H_m (see below).

World records

Current records

This table lists the current best upper bounds on [math]\displaystyle{ H_m }[/math] - the least quantity for which it is the case that there are infinitely many intervals [math]\displaystyle{ n, n+1, \ldots, n+H_m }[/math] which contain [math]\displaystyle{ m+1 }[/math] consecutive primes - both on the assumption of the Elliott-Halberstam conjecture (or more precisely, a generalization of this conjecture, formulated as Conjecture 1 in [BFI1986]), without this assumption, and without EH or the use of Deligne's theorems. The boldface entry - the bound on [math]\displaystyle{ H_1 }[/math] without assuming Elliott-Halberstam, but assuming the use of Deligne's theorems - is the quantity that has attracted the most attention. The conjectured value [math]\displaystyle{ H_1=2 }[/math] for [math]\displaystyle{ H_1 }[/math] is the twin prime conjecture.

[math]\displaystyle{ m }[/math] Conjectural Assuming EH Without EH Without EH or Deligne
1 2 6 (on GEH)

12 [M] (on EH only)

246 246
2 6 252 (on GEH)

270 (on EH only)

395,106 474,266
3 8 52,116 24,462,654 32,285,928
4 12 474,266 1,404,556,152 2,031,558,336
5 16 4,137,854 78,602,310,160 124,840,189,042
[math]\displaystyle{ m }[/math] [math]\displaystyle{ \displaystyle (1+o(1)) m \log m }[/math] [math]\displaystyle{ \displaystyle O( m e^{2m} ) }[/math] [math]\displaystyle{ O( \exp( 3.815 m) ) [BI] }[/math] [math]\displaystyle{ O( m \exp((4 - \frac{4}{43}) m) ) }[/math]

Unless listed below, all the above bounds were produced by the Polymath8 project.

We have been working on improving a number of other quantities, including the quantity [math]\displaystyle{ H_m }[/math] mentioned above:

  • [math]\displaystyle{ H = H_1 }[/math] is a quantity such that there are infinitely many pairs of consecutive primes of distance at most [math]\displaystyle{ H }[/math] apart. Would like to be as small as possible (this is a primary goal of the Polymath8 project).
  • [math]\displaystyle{ k_0 }[/math] is a quantity such that every admissible [math]\displaystyle{ k_0 }[/math]-tuple has infinitely many translates which each contain at least two primes. Would like to be as small as possible. Improvements in [math]\displaystyle{ k_0 }[/math] lead to improvements in [math]\displaystyle{ H }[/math]. (The relationship is roughly of the form [math]\displaystyle{ H \sim k_0 \log k_0 }[/math]; see the page on finding narrow admissible tuples.) More recent improvements on [math]\displaystyle{ k_0 }[/math] have come from solving a Selberg sieve variational problem.
  • [math]\displaystyle{ \varpi }[/math] is a technical parameter related to a specialized form of the Elliott-Halberstam conjecture. Would like to be as large as possible. Improvements in [math]\displaystyle{ \varpi }[/math] lead to improvements in [math]\displaystyle{ k_0 }[/math], as described in the page on Dickson-Hardy-Littlewood theorems. In more recent work, the single parameter [math]\displaystyle{ \varpi }[/math] is replaced by a pair [math]\displaystyle{ (\varpi,\delta) }[/math] (in previous work we had [math]\displaystyle{ \delta=\varpi }[/math]). These estimates are obtained in turn from Type I, Type II, and Type III estimates, as described at the page on distribution of primes in smooth moduli.

Timeline of bounds

A table of bounds as a function of time may be found at timeline of prime gap bounds. In this table, infinitesimal losses in [math]\displaystyle{ \delta,\varpi }[/math] are ignored.

Polymath threads

  1. I just can’t resist: there are infinitely many pairs of primes at most 59470640 apart, Scott Morrison, 30 May 2013. Inactive
  2. The prime tuples conjecture, sieve theory, and the work of Goldston-Pintz-Yildirim, Motohashi-Pintz, and Zhang, Terence Tao, 3 June 2013. Inactive
  3. Polymath proposal: bounded gaps between primes, Terence Tao, 4 June 2013. Inactive
  4. Online reading seminar for Zhang’s “bounded gaps between primes”, Terence Tao, 4 June 2013. Inactive
  5. More narrow admissible sets, Scott Morrison, 5 June 2013. Inactive
  6. The elementary Selberg sieve and bounded prime gaps, Terence Tao, 8 June 2013. Inactive
  7. A combinatorial subset sum problem associated with bounded prime gaps, Terence Tao, 10 June 2013. Inactive
  8. Further analysis of the truncated GPY sieve, Terence Tao, 11 June 2013. Inactive
  9. Estimation of the Type I and Type II sums, Terence Tao, 12 June 2013. Inactive
  10. Estimation of the Type III sums, Terence Tao, 14 June 2013. Inactive
  11. A truncated elementary Selberg sieve of Pintz, Terence Tao, 18 June, 2013. Inactive
  12. Bounding short exponential sums on smooth moduli via Weyl differencing, Terence Tao, 22 June, 2013. Inactive
  13. The distribution of primes in densely divisible moduli, Terence Tao, 23 June, 2013. Inactive
  14. Bounded gaps between primes (Polymath8) – a progress report, Terence Tao, 30 June 2013. Inactive
  15. The quest for narrow admissible tuples, Andrew Sutherland, 2 July 2013. Inactive
  16. The distribution of primes in doubly densely divisible moduli, Terence Tao, 7 July 2013. Inactive.
  17. An improved Type I estimate, Terence Tao, 27 July 2013. Inactive
  18. Polymath8: writing the paper, Terence Tao, 17 August 2013. Inactive
  19. Polymath8: writing the paper, II, Terence Tao, 2 September 2013. Inactive
  20. Polymath8: writing the paper, III, Terence Tao, 22 September 2013. Inactive
  21. Polymath8: writing the paper, IV, Terence Tao, 15 October 2013. Inactive
  22. Polymath8: Writing the first paper, V, and a look ahead, Terence Tao, 17 November 2013. Inactive
  23. Polymath8b: Bounded intervals with many primes, after Maynard, Terence Tao, 19 November 2013. Inactive
  24. Polymath8b, II: Optimising the variational problem and the sieve Terence Tao, 22 November 2013. Inactive
  25. Polymath8b, III: Numerical optimisation of the variational problem, and a search for new sieves, Terence Tao, 8 December 2013. Inactive
  26. Polymath8b, IV: Enlarging the sieve support, more efficient numerics, and explicit asymptotics, Terence Tao, 20 December 2013. Inactive
  27. Polymath8b, V: Stretching the sieve support further, Terence Tao, 8 January 2014. Inactive
  28. Polymath8b, VI: A low-dimensional variational problem, Terence Tao, 17 January 2014. Inactive
  29. Polymath8b, VII: Using the generalised Elliott-Halberstam hypothesis to enlarge the sieve support yet further, Terence Tao, 28 January 2014. Inactive
  30. “New equidistribution estimates of Zhang type, and bounded gaps between primes” – and a retrospective, Terence Tao, 7 February 2013. Inactive
  31. Polymath8b, VIII: Time to start writing up the results?, Terence Tao, 9 February 2014. Inactive
  32. Polymath8b, IX: Large quadratic programs, Terence Tao, 21 February 2014. Inactive
  33. Polymath8b, X: Writing the paper, and chasing down loose ends, Terence Tao, 14 April 2014. Inactive
  34. Polymath 8b, XI: Finishing up the paper, Terence Tao, 17 May 2014.Inactive
  35. Polymath8: wrapping up, Terence Tao, 19 June 2014. Inactive
  36. Variants of the Selberg sieve, and bounded intervals containing many primes, Terence Tao, 21 July 2014. Inactive
  37. The "bounded gaps between primes" Polymath project - a retrospective, Terence Tao, 30 September 2014. Active

Writeup

Here are the Polymath8 grant acknowledgments.

Code and data

Tuples applet

Here is a small javascript applet that illustrates the process of sieving for an admissible 632-tuple of diameter 4680 (the sieved residue classes match the example in the paper when translated to [0,4680]).

The same applet can also be used to interactively create new admissible tuples. The default sieve interval is [0,400], but you can change the diameter to any value you like by adding “?d=nnnn” to the URL (e.g. use https://math.mit.edu/~primegaps/sieve.html?d=4680 for diameter 4680). The applet will highlight a suggested residue class to sieve in green (corresponding to a greedy choice that doesn’t hit the end points), but you can sieve any classes you like.

You can also create sieving demos similar to the k=632 example above by specifying a list of residues to sieve. A longer but equivalent version of the “?ktuple=632″ URL is

https://math.mit.edu/~primegaps/sieve.html?d=4680&r=1,1,4,3,2,8,2,14,13,8,29,31,33,28,6,49,21,47,58,35,57,44,1,55,50,57,9,91,87,45,89,50,16,19,122,114,151,66

The numbers listed after “r=” are residue classes modulo increasing primes 2,3,5,7,…, omitting any classes that do not require sieving — the applet will automatically skip such primes (e.g. it skips 151 in the k=632 example).

A few caveats: You will want to run this on a PC with a reasonably wide display (say 1360 or greater), and it has only been tested on the current versions of Chrome and Firefox.

Errata

Page numbers refer to the file linked to for the relevant paper.

  1. Errata for Zhang's "Bounded gaps between primes"
    1. Page 5: In the first display, [math]\displaystyle{ \mathcal{E} }[/math] should be multiplied by [math]\displaystyle{ \mathcal{L}^{2k_0+2l_0} }[/math], because [math]\displaystyle{ \lambda(n)^2 }[/math] in (2.2) can be that large, cf. (2.4).
    2. Page 14: In the final display, the constraint [math]\displaystyle{ (n,d_1=1 }[/math] should be [math]\displaystyle{ (n,d_1)=1 }[/math].
    3. Page 35: In the display after (10.5), the subscript on [math]\displaystyle{ {\mathcal J}_i }[/math] should be deleted.
    4. Page 36: In the third display, a factor of [math]\displaystyle{ \tau(q_0r)^{O(1)} }[/math] may be needed on the right-hand side (but is ultimately harmless).
    5. Page 38: In the display after (10.14), [math]\displaystyle{ \xi(r,a;q_1,b_1;q_2,b_2;n,k) }[/math] should be [math]\displaystyle{ \xi(r,a;k;q_1,b_1;q_2,b_2;n) }[/math].
    6. Page 42: In (12.3), [math]\displaystyle{ B }[/math] should probably be 2.
    7. Page 47: In the third display after (13.13), the condition [math]\displaystyle{ l \in {\mathcal I}_i(h) }[/math] should be [math]\displaystyle{ l \in {\mathcal I}_i(sh) }[/math].
    8. Page 49: In the top line, a comma in [math]\displaystyle{ (h_1,h_2;,n_1,n_2) }[/math] should be deleted.
    9. Page 51: In the penultimate display, one of the two consecutive commas should be deleted.
    10. Page 54: Three displays before (14.17), [math]\displaystyle{ \bar{r_2}(m_1+m_2)q }[/math] should be [math]\displaystyle{ \bar{r_2}(m_1+m_2)/q }[/math].
  2. Errata for Motohashi-Pintz's "A smoothed GPY sieve", version 1. Update: the errata below have been corrected in the most recent arXiv version of the paper.
    1. Page 31: The estimation of (5.14) by (5.15) does not appear to be justified. In the text, it is claimed that the second summation in (5.14) can be treated by a variant of (4.15); however, whereas (5.14) contains a factor of [math]\displaystyle{ (\log \frac{R}{|D|})^{2\ell+1} }[/math], (4.15) contains instead a factor of [math]\displaystyle{ (\log \frac{R/w}{|K|})^{2\ell+1} }[/math] which is significantly smaller (K in (4.15) plays a similar role to D in (5.14)). As such, the crucial gain of [math]\displaystyle{ \exp(-k\omega/3) }[/math] in (4.15) does not seem to be available for estimating the second sum in (5.14).
  3. Errata for Pintz's "A note on bounded gaps between primes", version 1. Update: the errata below have been corrected in subsequent versions of Pintz's paper.
    1. Page 7: In (2.39), the exponent of [math]\displaystyle{ 3a/2 }[/math] should instead be [math]\displaystyle{ -5a/2 }[/math] (it comes from dividing (2.38) by (2.37)). This impacts the numerics for the rest of the paper.
    2. Page 8: The "easy calculation" that the relative error caused by discarding all but the smooth moduli appears to be unjustified, as it relies on the treatment of (5.14) in Motohashi-Pintz which has the issue pointed out in 2.1 above.

Other relevant blog posts

MathOverflow

Wikipedia and other references

Recent papers and notes

Media

Bibliography

Additional links for some of these references (e.g. to arXiv versions) would be greatly appreciated.

  • [BFI1986] Bombieri, E.; Friedlander, J. B.; Iwaniec, H. Primes in arithmetic progressions to large moduli. Acta Math. 156 (1986), no. 3-4, 203–251. MathSciNet Article
  • [BFI1987] Bombieri, E.; Friedlander, J. B.; Iwaniec, H. Primes in arithmetic progressions to large moduli. II. Math. Ann. 277 (1987), no. 3, 361–393. MathSciNet Article
  • [BFI1989] Bombieri, E.; Friedlander, J. B.; Iwaniec, H. Primes in arithmetic progressions to large moduli. III. J. Amer. Math. Soc. 2 (1989), no. 2, 215–224. MathSciNet Article
  • [B1995] Jörg Brüdern, Einführung in die analytische Zahlentheorie, Springer Verlag 1995
  • [CJ2001] Clark, David A.; Jarvis, Norman C.; Dense admissible sequences. Math. Comp. 70 (2001), no. 236, 1713–1718 MathSciNet Article
  • [FI1981] Fouvry, E.; Iwaniec, H. On a theorem of Bombieri-Vinogradov type., Mathematika 27 (1980), no. 2, 135–152 (1981). MathSciNet Article
  • [FI1983] Fouvry, E.; Iwaniec, H. Primes in arithmetic progressions. Acta Arith. 42 (1983), no. 2, 197–218. MathSciNet Article
  • [FI1985] Friedlander, John B.; Iwaniec, Henryk, Incomplete Kloosterman sums and a divisor problem. With an appendix by Bryan J. Birch and Enrico Bombieri. Ann. of Math. (2) 121 (1985), no. 2, 319–350. MathSciNet JSTOR Appendix
  • [GPY2009] Goldston, Daniel A.; Pintz, János; Yıldırım, Cem Y. Primes in tuples. I. Ann. of Math. (2) 170 (2009), no. 2, 819–862. arXiv MathSciNet
  • [GR1998] Gordon, Daniel M.; Rodemich, Gene Dense admissible sets. Algorithmic number theory (Portland, OR, 1998), 216–225, Lecture Notes in Comput. Sci., 1423, Springer, Berlin, 1998. MathSciNet Article
  • [GR1980] S. W. Graham, C. J. Ringrose, Lower bounds for least quadratic nonresidues. Analytic number theory (Allerton Park, IL, 1989), 269–309, Progr. Math., 85, Birkhäuser Boston, Boston, MA, 1990. MathSciNet Article
  • [HB1978] D. R. Heath-Brown, Hybrid bounds for Dirichlet L-functions. Invent. Math. 47 (1978), no. 2, 149–170. MathSciNet Article
  • [HB1986] D. R. Heath-Brown, The divisor function d3(n) in arithmetic progressions. Acta Arith. 47 (1986), no. 1, 29–56. MathSciNet Article
  • [HR1973] Hensley, Douglas; Richards, Ian, On the incompatibility of two conjectures concerning primes. Analytic number theory (Proc. Sympos. Pure Math., Vol. XXIV, St. Louis Univ., St. Louis, Mo., 1972), pp. 123–127. Amer. Math. Soc., Providence, R.I., 1973. MathSciNet Article
  • [HR1973b] Hensley, Douglas; Richards, Ian, Primes in intervals. Acta Arith. 25 (1973/74), 375–391. MathSciNet Article
  • [MP2008] Motohashi, Yoichi; Pintz, János A smoothed GPY sieve. Bull. Lond. Math. Soc. 40 (2008), no. 2, 298–310. arXiv MathSciNet Article
  • [MV1973] Montgomery, H. L.; Vaughan, R. C. The large sieve. Mathematika 20 (1973), 119–134. MathSciNet Article
  • [M1978] Hugh L. Montgomery, The analytic principle of the large sieve. Bull. Amer. Math. Soc. 84 (1978), no. 4, 547–567. MathSciNet Article
  • [R1974] Richards, Ian On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problem. Bull. Amer. Math. Soc. 80 (1974), 419–438. MathSciNet Article
  • [S1961] Schinzel, A. Remarks on the paper "Sur certaines hypothèses concernant les nombres premiers". Acta Arith. 7 1961/1962 1–8. MathSciNet Article
  • [S2007] K. Soundararajan, Small gaps between prime numbers: the work of Goldston-Pintz-Yıldırım. Bull. Amer. Math. Soc. (N.S.) 44 (2007), no. 1, 1–18. MathSciNet Article arXiv