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
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 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 .
Full work available at URL: https://arxiv.org/abs/1409.7160
Recommendations
- Inverse questions for the large sieve
- An improvement for the large sieve for square moduli
- How small must ill-distributed sets be?
- scientific article; zbMATH DE number 566012
- On variants of the larger sieve
- The large sieve with square norm moduli in \protect \mathbb{Z}[i]
- Large sieve for special characters to Gaussian prime square moduli
- scientific article; zbMATH DE number 2246201
- The square sieve and the large sieve with square moduli
- The Brun-Titchmarsh theorem
Cited In (7)
- Exponential Sums, Twisted Multiplicativity, and Moments
- Inverse questions for the large sieve
- Large sieve estimate for multivariate polynomial moduli and applications
- Iteration of quadratic polynomials over finite fields
- Variation estimates for averages along primes and polynomials
- The inverse sieve problem for algebraic varieties over global fields
- Current trends and open problems in arithmetic dynamics
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)