Inverse questions for the large sieve
Abstract
Suppose that an infinite set A occupies at most 12(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(X1/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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.