15 July 2015 When the sieve works
Andrew Granville, Dimitris Koukoulopoulos, Kaisa Matomäki
Duke Math. J. 164(10): 1935-1969 (15 July 2015). DOI: 10.1215/00127094-3120891

Abstract

We are interested in classifying those sets of primes P such that when we sieve out the integers up to x by the primes in P c we are left with roughly the expected number of unsieved integers. In particular, we obtain the first general results for sieving an interval of length x with primes including some in ( x , x ] , using methods motivated by additive combinatorics.

Citation

Download Citation

Andrew Granville. Dimitris Koukoulopoulos. Kaisa Matomäki. "When the sieve works." Duke Math. J. 164 (10) 1935 - 1969, 15 July 2015. https://doi.org/10.1215/00127094-3120891

Information

Received: 20 December 2013; Revised: 9 September 2014; Published: 15 July 2015
First available in Project Euclid: 14 July 2015

zbMATH: 1326.11055
MathSciNet: MR3369306
Digital Object Identifier: 10.1215/00127094-3120891

Subjects:
Primary: 11N35
Secondary: 11B30

Keywords: additive combinatorics , Balog–Szemeredi–Gowers theorem , continuous postage stamp problem , Ruzsa–Chang theorem , sieve methods

Rights: Copyright © 2015 Duke University Press

Vol.164 • No. 10 • 15 July 2015
Back to Top