When the sieve works

From MaRDI portal
Publication:498664

DOI10.1215/00127094-3120891zbMATH Open1326.11055arXiv1205.0413OpenAlexW3100178051MaRDI QIDQ498664FDOQ498664


Authors: Andrew Granville, Dimitris Koukoulopoulos, Kaisa Matomäki Edit this on Wikidata


Publication date: 29 September 2015

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Abstract: We are interested in classifying those sets of primes mathcalP such that when we sieve out the integers up to x by the primes in mathcalPc 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 (sqrtx,x], using methods motivated by additive combinatorics.


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




Recommendations





Cited In (21)





This page was built for publication: When the sieve works

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