Lower Bounds for Expressions of Large Sieve Type
Number Theory
2011-05-09 v1
Abstract
We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erd\"os and Renyi.
Cite
@article{arxiv.1105.1307,
title = {Lower Bounds for Expressions of Large Sieve Type},
author = {Jan-Christoph Schlage-Puchta},
journal= {arXiv preprint arXiv:1105.1307},
year = {2011}
}