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

From MaRDI portal
Publication:901790

DOI10.2140/ANT.2015.9.2325zbMATH Open1331.11083arXiv1409.7160OpenAlexW1665107440MaRDI QIDQ901790FDOQ901790


Authors: Xuancheng Shao Edit this on Wikidata


Publication date: 12 January 2016

Published in: Algebra \& Number Theory (Search for Journal in Brave)

Abstract: This paper is motivated by the following question in sieve theory. Given a subset Xsubset[N] and alphain(0,1/2). Suppose that |Xpmodp|leq(alpha+o(1))p for every prime p. How large can X be? On the one hand, we have the bound |X|llalphaNalpha 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 |X|llalphaNO(alpha2014) for small alpha). The result follows from studying the average size of |Xpmodp| as p varies, when X=f(mathbbZ)cap[N] is the value set of a polynomial f(x)inmathbbZ[x].


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




Recommendations





Cited In (7)





This page was built for publication: Polynomial values modulo primes on average and sharpness of the larger sieve

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