Abstract: We are interested in classifying those sets of primes such that when we sieve out the integers up to by the primes in 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 with primes including some in , using methods motivated by additive combinatorics.
Recommendations
Cited in
(21)- Real zeros of holomorphic Hecke cusp forms and sieving short intervals
- The Duffin-Schaeffer conjecture with extra divergence
- scientific article; zbMATH DE number 3467227 (Why is no real title available?)
- Quadratic fields admitting elliptic curves with rational \(j\)-invariant and good reduction everywhere
- On an almost all version of the Balog-Szemerédi-Gowers theorem
- Joint equidistribution of CM points
- Sur un problème de crible et ses applications
- When the sieve works. II
- Variants of Khintchine's theorem in metric Diophantine approximation
- On an almost-prime sieve
- Upper bound of the local law for certain additive functions
- scientific article; zbMATH DE number 3342913 (Why is no real title available?)
- On the minimal number of small elements generating finite prime fields
- Sign changes of Hecke eigenvalues
- Primality testing with Gaussian periods
- On the joint distribution of the two ``number of prime factors functions.
- LOCAL DENSITIES OVER INTEGERS FREE OF LARGE PRIME FACTORS
- On the simultaneous distribution of powers of prime numbers modulo one
- scientific article; zbMATH DE number 1936551 (Why is no real title available?)
- Integers with no large prime factors
- On signs of Fourier coefficients of Hecke-Maass cusp forms on 𝐺𝐿₃
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)