Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y Zhang (2014)
Bounded gaps between primesAnnals Math, 179
GH Hardy, JE Littlewood (1923)
Some problems of “Partitio Numerorum”, III: on the expression of a number as a sum of primesActa Math, 44
HL Montgomery (1971)
Topics in Multiplicative Number Theory, volume 227. Lecture Notes in Math
E Bombieri, J Friedlander, H Iwaniec (1986)
Primes in arithmetic progressions to large moduliActa Math, 156
E Fouvry (1985)
Théorḿe de Brun-Titchmarsh: application au théorème de FermatInvent. Math, 79
Y Motohashi, J Pintz (2008)
A smoothed GPY sieveBull. Lond. Math. Soc, 40
PDTA Elliott, H Halberstam (1968)
A conjecture in prime number theorySymp. Math, 4
J Pintz (2012)
The bounded gap conjecture and bounds between consecutive Goldbach numbersActa Arith, 155
D Goldston, C Yıldırım (2003)
Higher correlations of divisor sums related to primes. I. Triple correlationsIntegers, 3
RC Vaughan (1977)
Sommes trigonométriques sur les nombres premiersC. R. Acad. Sci. Paris Sér. A, 285
É Fouvry, H Iwaniec (1983)
Primes in arithmetic progressionsActa Arith, 42
A Schinzel (1961/1962)
Remarks on the paper “Sur certaines hypothèses concernant les nombres premiers”Acta Arith, 7
D Clark, N Jarvis (2001)
Dense admissible sequencesMath. Comp, 70
I Richards (1974)
On the incompatibility of two conjectures concerning primes; a discussion of the use of computers in attacking a theoretical problemBull. Amer. Math. Soc, 80
DR Heath-Brown (1982)
Prime numbers in short intervals and a generalized Vaughan identityCanad. J. Math, 34
J Friedlander, A Granville, A Hildebrand, H Maier (1991)
Oscillation theorems for primes in arithmetic progressions and for sifting functionsJ. Amer. Math. Soc, 4
J Pintz (2010)
Are there arbitrarily long arithmetic progressions in the sequence of twin primes? An irregular mind. Szemerédi is 70Bolyai Soc. Math. Stud. Springer, 21
AI Vinogradov (1956)
The density hypothesis for Dirichlet L-seriesIzv. Akad. Nauk SSSR Ser. Mat. (in Russian), 29
Y Motohashi (1976)
An induction principle for the generalization of Bombieri’s prime number theoremProc. Japan Acad, 52
A Schönhage, V Strassen (1971)
Schnelle Multiplikation großer ZahlenComput. Arch. Elektron. Rechnen, 7
K Soundararajan (2007)
Small gaps between prime numbers: the work of Goldston-Pintz-YıldırımBull. Amer. Math. Soc. (N.S.), 44
D Goldston, J Pintz, C Yıldırım (2009)
Primes in tuplesI. Ann. Math, 170
A Selberg (1989)
Proc. 11th Scand. Math. Cong. Trondheim (1949), Collected Works, vol. I,
For any m≥1, let H m denote the quantity liminf n → ∞ ( p n + m − p n ) . A celebrated recent result of Zhang showed the finiteness of H 1, with the explicit bound H 1≤70,000,000. This was then improved by us (the Polymath8 project) to H 1≤4680, and then by Maynard to H 1≤600, who also established for the first time a finiteness result for H m for m≥2, and specifically that H m ≪m 3 e 4m . If one also assumes the Elliott-Halberstam conjecture, Maynard obtained the bound H 1≤12, improving upon the previous bound H 1≤16 of Goldston, Pintz, and Yıldırım, as well as the bound H m ≪m 3 e 2m .
Research in the Mathematical Sciences – Springer Journals
Published: Oct 17, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.