Close encounters among the primes

DOI10.1007/S13226-014-0083-6zbMATH Open1362.11080arXiv1312.2926OpenAlexW2003443132MaRDI QIDQ5963320FDOQ5963320

H. Iwaniec, J. B. Friedlander

Publication date: 7 March 2016

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Abstract: This paper was written, apart from one technical correction, in July and August of 2013. The, then very recent, breakthrough of Y. Zhang cite{Z} had revived in us an intention to produce a second edition of our book "Opera de Cribro", one which would include an account of Zhang's result, stressing the sieve aspects of the method. A complete and connected version of the proof, in our style but not intended for journal publication, seemed a natural first step in this project. Following the further spectacular advance given by J. Maynard (arXiv:1311.4600, Nov 20, 2013), we have had to re-think our position. Maynard's method, at least in its current form, proceeds from GPY in quite a different direction than does Zhang's, and achieves numerically superior results. Consequently, although Zhang's contribution to the distribution of primes in arithmetic progressions certainly retains its importance, the fact remains that much of the material in this paper would no longer appear in a new edition of our book. Because this paper contains some innovations that we do not wish to become lost, we have decided to make the work publicly available in its current form.

Full work available at URL: https://arxiv.org/abs/1312.2926

zbMATH Keywords

primesarithmetic progressionssieves

Mathematics Subject Classification ID

Distribution of primes (11N05) Applications of sieve methods (11N36) Primes in congruence classes (11N13) Sieves (11N35)

Cites Work

• Title not available (Why is that?)
• Primes in arithmetic progressions to large moduli
• Bounded gaps between primes
• A smoothed GPY sieve
• Primes in arithmetic progressions
• Primes in tuples. I
• Small differences between prime numbers
• Incomplete Kloosterman sums and a divisor problem. Appendix: On some exponential sums by Bryan J. Birch and Enrico Bombieri
• Around the Bombieri-Vinogradov theorem
• Title not available (Why is that?)
• Primes in arithmetic progressions to large moduli. II
• Small differences between prime numbers
• Primes in Arithmetic Progressions to Large Moduli. III
• Higher correlations of divisor sums related to primes III: small gaps between primes
• On the differences of primes in arithmetical progressions

Cited In (4)

• Primes in intervals of bounded length
• Levels of distribution and the affine sieve
• Generalized divisor functions in arithmetic progressions: I.
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A journey through the world of primes 👍 👎
• Primes in prime number races 👍 👎
• Non-Ordinary Primes: A Story 👍 👎
• Some strange primes 👍 👎
• Almost primes in various settings 👍 👎
• Title not available (Why is that?) 👍 👎
• Primes in short intervals 👍 👎

This page was built for publication: Close encounters among the primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963320)