Lower Bounds for Expressions of Large Sieve Type

preprint2011arXivOpen access

Abstract

We show that the large sieve is optimal for almost all exponential sums, thus proving a conjecture by Erdös and Renyi.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.