Inverse questions for the large sieve
Number Theory
2013-11-26 v1
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.
Cite
@article{arxiv.1311.6176,
title = {Inverse questions for the large sieve},
author = {Ben J. Green and Adam J. Harper},
journal= {arXiv preprint arXiv:1311.6176},
year = {2013}
}
Comments
31 pages