On a variant of the large sieve

Details On a variant of the large sieve On a variant of the large sieve

2008-07-31

arxiv.org/abs/0807.5037v2

Mathematics

Number Theory

7 pages. The paper has been shortened and the result strengthened now that my attention has been drawn to a paper of Robert an

Scientific paper

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some interval I_p of Z/pZ of length (p-1)/2. Let A be the set that remains: then |A| << N^{1/3 + o(1)}, a bound which improves slightly on the bound of |A| << N^{1/2} which results from applying the large sieve in its usual form. This is a very, very weak result in the direction of a question of Helfgott and Venkatesh, who suggested that nothing like equality can occur in applications of the large sieve unless the unsieved set is essentially the set of values of a polynomial (e.g. A is the set of squares). Assuming the ``exponent pairs conjecture'' (which is deep, as it implies a host of classical questions including the Lindel\"of hypothesis, Gauss circle problem and Dirichlet divisor problem) the bound can be improved to |A| << N^{o(1)}. This raises the worry that even reasonably simple sieve problems are connected to issues of which we have little understanding at the present time.

Affiliated with

Also associated with

No associations

Rating

On a variant of the large sieve 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 On a variant of the large sieve, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a variant of the large sieve will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363544