Long gaps in sieved sets
Abstract
For each prime , let denote a collection of residue classes modulo such that the cardinalities are bounded and about on average. We show that for sufficiently large , the sifted set contains gaps of size at least where depends only on the density of primes for which . This improves on the "trivial" bound of . As a consequence, for any non-constant polynomial with positive leading coefficient, the set contains an interval of consecutive integers of length for sufficiently large , where depends only on the degree of .
Cite
@article{arxiv.1802.07604,
title = {Long gaps in sieved sets},
author = {Kevin Ford and Sergei Konyagin and James Maynard and Carl Pomerance and Terence Tao},
journal= {arXiv preprint arXiv:1802.07604},
year = {2023}
}
Comments
Corrects a number of errors in the published version pointed out to us by Mikhail Gabdullin. The specific corrections are listed in an Appendix. One of these causes a slight degradation of the numerical values for the exponents of log log x in Theorem 1 and Corollaries