A Smoothed GPY Sieve

Abstract

We show a smoothed version of Goldston-Pintz-Yildirim's sifting argument to detect small gaps between primes, which has a higly flexible error term. Our argument is applicable to high dimensional Selberg sieve situations as well, although the relevant details are not stated explicitly. In the present v.2, we have added Appendix in which we made a minor correction to our reasoning following formula (5.14). We are indebted to Professor Terrence Tao for pointing out the necessity of this amendment. The text of the original version has not been changed, except for a correction of the title in the item [2] of the references.

17 pages

References in corpus (1)

• An Overview of the Sieve Method and its History

Cited by in corpus (9)

• New equidistribution estimates of Zhang type
• Primes in intervals of bounded length
• Variants of the Selberg sieve, and bounded intervals containing many primes
• Bounded prime gaps in short intervals
• A note on the Polignac numbers
• On Some Improvements of the Brun-Titchmarsh Theorem. IV
• Diagonal cubic forms and the large sieve
• Close encounters among the primes
• The twin prime conjecture