Lower Bounds for Expressions of Large Sieve Type
arXiv:1105.1307
Abstract
We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erdös and Renyi.
arXiv:1105.1307
We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erdös and Renyi.