Lower Bounds for Expressions of Large Sieve Type

Details Lower Bounds for Expressions of Large Sieve Type Lower Bounds for Expressions of Large Sieve Type

2011-05-06

arxiv.org/abs/1105.1307v1

Arch. Math. (Brno) 45 (2009), no. 2, 79-82

Mathematics

Number Theory

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Lower Bounds for Expressions of Large Sieve Type does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower Bounds for Expressions of Large Sieve Type, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower Bounds for Expressions of Large Sieve Type will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-576712