Inverse questions for the large sieve
From MaRDI portal
Publication:484089
DOI10.1007/S00039-014-0288-1zbMATH Open1316.11085arXiv1311.6176OpenAlexW2032644407MaRDI QIDQ484089FDOQ484089
Publication date: 18 December 2014
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Abstract: Suppose that an infinite set occupies at most residue classes modulo , for every sufficiently large prime . The squares, or more generally the integer values of any quadratic, are an example of such a set. By the large sieve inequality the number of elements of that are at most is , and the quadratic examples show that this is sharp. The simplest form of the inverse large sieve problem asks whether they are the only examples. We prove a variety of results and formulate various conjectures in connection with this problem, including several improvements of the large sieve bound when the residue classes occupied by have some additive structure. Unfortunately we cannot solve the problem itself.
Full work available at URL: https://arxiv.org/abs/1311.6176
Recommendations
additive structurearithmetic progressionsum of setslarge sievesquare-free numberinverse large sievequadratic structurequasi-square numbersmall sieveuniform fibres condition
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A mean value estimate for real character sums
- A large sieve density estimate near \(\sigma = 1\)
- A Note on the Large Sieve
- How small must ill-distributed sets be?
- The inverse sieve problem in high dimensions
- Title not available (Why is that?)
- A larger sieve
- Title not available (Why is that?)
- Title not available (Why is that?)
- Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
- Additive decompositions of sets with restricted prime factors
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Generalisation of the Theorem of Cauchy and Davenport
- The inverse Goldbach problem
Cited In (8)
- Additive decompositions of sets with restricted prime factors
- Additive correlation and the inverse problem for the large sieve
- The inverse sieve problem in high dimensions
- How small must ill-distributed sets be?
- The algebraicity of ill-distributed sets
- Polynomial values modulo primes on average and sharpness of the larger sieve
- Mixing time of the Chung-Diaconis-Graham random process
- Any small multiplicative subgroup is not a sumset
This page was built for publication: Inverse questions for the large sieve
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484089)