paper

Polynomial values modulo primes on average and sharpness of the larger sieve

arXiv:1409.7160

Abstract

This paper is motivated by the following question in sieve theory. Given a subset and . Suppose that for every prime . How large can be? On the one hand, we have the bound from Gallagher's larger sieve. On the other hand, we prove, assuming the truth of an inverse sieve conjecture, that the bound above can be improved (for example, to for small ). The result follows from studying the average size of as varies, when is the value set of a polynomial .

18 pages

References in corpus (2)