Bounded gaps between primes: Difference between revisions

From Polymath Wiki
Jump to navigationJump to search
Line 3: Line 3:
{| border=1
{| border=1
|-
|-
!Date!!<math>\varpi</math>!! <math>k_0</math> !! <math>H</math>  
!Date!!<math>\varpi</math>!! <math>k_0</math> !! <math>H</math> !! Comments
|-
|-
| 14 May  
| 14 May  
| 1/1168 (Zhang)  
| 1/1168 ([http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Zhang])  
| 3,500,000 (Zhang)
| 3,500,000 ([http://annals.math.princeton.edu/wp-content/uploads/YitangZhang.pdf Zhang])
| 70,000,000 (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
| 21 May
|
|
|
|
| 63,374,611 (Lewko)
| 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
| 28 May
|
|
|  
|  
| 59,874,594 (Trudgian)
| 59,874,594 ([http://arxiv.org/abs/1305.6369 Trudgian])
| Uses <math>(p_{m+1},\ldots,p_{m+k_0})</math> with <math>p_{m+1} > k_0</math>
|-
|-
| 30 May
| 30 May
|
|
|
|
| 59,470,640 (Morrison)
| 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])
59,093,364 (Morrison)
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])


58,885,998 (Tao, conditional)
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 (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
| 31 May
|
|
| 2,618,607 (Morrison)
| 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])
| 42,543,038 (Morrison)
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])
42,342,946 (Morrison)
| 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])
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])
| Optimising Zhang's condition <math>\omega>0</math>, and then using 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
| 1 Jun
|
|
|
|
| 42,342,924 (Tao)
| 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])
| Tiny improvement using the parity of <math>k_0</math>
|-
|-
| 2 Jun
| 2 Jun
|
|
| 866,605 (Morrison)
| 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])
| 13,008,612 (Morrison)
| 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])
| 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>)
|-
|-
| 3 Jun
| 3 Jun
|
|
| 341,640 (Morrison)
| 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])
| 4,982,086 (Morrison)
| 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])
4,802,222 (Morrison)
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])
| 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.
|}
|}



Revision as of 11:52, 4 June 2013

World records

Date [math]\displaystyle{ \varpi }[/math] [math]\displaystyle{ k_0 }[/math] [math]\displaystyle{ H }[/math] Comments
14 May 1/1168 (Zhang) 3,500,000 (Zhang) 70,000,000 (Zhang) All subsequent work is based on Zhang's breakthrough paper.
21 May 63,374,611 (Lewko) Optimises Zhang's condition [math]\displaystyle{ \pi(H)-\pi(k_0) \gt k_0 }[/math]; can be reduced by 1 by parity considerations
28 May 59,874,594 (Trudgian) Uses [math]\displaystyle{ (p_{m+1},\ldots,p_{m+k_0}) }[/math] with [math]\displaystyle{ p_{m+1} \gt k_0 }[/math]
30 May 59,470,640 (Morrison)

58,885,998? (Tao)

59,093,364 (Morrison)

57,554,086 (Morrison)

Uses [math]\displaystyle{ (p_{m+1},\ldots,p_{m+k_0}) }[/math] and then [math]\displaystyle{ (\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 2,947,442 (Morrison)

2,618,607 (Morrison)

48,112,378 (Morrison)

42,543,038 (Morrison)

42,342,946 (Morrison)

Optimising Zhang's condition [math]\displaystyle{ \omega\gt 0 }[/math], and then using an improved bound on [math]\displaystyle{ \delta_2 }[/math]
1 Jun 42,342,924 (Tao) Tiny improvement using the parity of [math]\displaystyle{ k_0 }[/math]
2 Jun 866,605 (Morrison) 13,008,612 (Morrison) Uses a further improvement on the quantity [math]\displaystyle{ \Sigma_2 }[/math] in Zhang's analysis (replacing the previous bounds on [math]\displaystyle{ \delta_2 }[/math])
3 Jun 341,640 (Morrison) 4,982,086 (Morrison)

4,802,222 (Morrison)

Uses a different method to establish [math]\displaystyle{ DHL[k_0,2] }[/math] that removes most of the inefficiency from Zhang's method.

Polymath threads

Code and data

Other relevant blog posts

MathOverflow

Wikipedia

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
  • [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
  • [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. JSTOR
  • [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
  • [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
  • [MV1973] Montgomery, H. L.; Vaughan, R. C. The large sieve. Mathematika 20 (1973), 119–134. MathSciNet
  • [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
  • [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