Inverse questions for the large sieve

DOI10.1007/S00039-014-0288-1MaRDI QIDQ484089zbMATH OpenOpenAlexFDO

Authors Adam J. Harper, Ben Green

Publication date 18 December 2014

Published in Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1311.6176, http://wrap.warwick.ac.uk/107458/7/WRAP-inverse-questions-large-sieve-Green-2018.pdf

zbMATH Keywords

additive structurearithmetic progressioninverse large sievelarge sievequadratic structurequasi-square numbersmall sievesquare-free numbersum of setsuniform fibres condition

Mathematics Subject Classification ID

Sieves (11N35)

Abstract: Suppose that an infinite set $A$ occupies at most $frac12(p+1)$ residue classes modulo $p$, for every sufficiently large prime $p$. 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 $A$ that are at most $X$ is $O(X^{1/2})$, 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 $A$ have some additive structure. Unfortunately we cannot solve the problem itself.

Recommendations

• Additive correlation and the inverse problem for the large sieve
• Polynomial values modulo primes on average and sharpness of the larger sieve
• Distribution of Squares Modulo a Composite Number
• The inverse sieve problem in high dimensions
• The inverse Goldbach problem

Cites work

• A Generalisation of the Theorem of Cauchy and Davenport
• A large sieve density estimate near \(\sigma = 1\)
• A larger sieve
• A mean value estimate for real character sums
• A Note on the Large Sieve
• Additive decompositions of sets with restricted prime factors
• Analytic number theory. Exploring the anatomy of integers
• Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
• How small must ill-distributed sets be?
• scientific article; zbMATH DE number 3120121 (Why is no real title available?)
• scientific article; zbMATH DE number 3675980 (Why is no real title available?)
• scientific article; zbMATH DE number 3523684 (Why is no real title available?)
• scientific article; zbMATH DE number 3582249 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• Open problems in additive combinatorics
• Opera de cribro
• The inverse Goldbach problem
• The inverse sieve problem in high dimensions

Cited in

(10)

• The inverse sieve problem for algebraic varieties over global fields
• Any small multiplicative subgroup is not a sumset
• The algebraicity of ill-distributed sets
• Mixing time of the Chung-Diaconis-Graham random process
• Additive decompositions of sets with restricted prime factors
• How small must ill-distributed sets be?
• The inverse sieve problem in high dimensions
• Conductors for sets of large integer squares
• Additive correlation and the inverse problem for the large sieve
• Polynomial values modulo primes on average and sharpness of the larger sieve

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)