Stephan Baier
Published 2005-12-12Version 1
Extending a method of D. Wolke, we establish a general result on the large sieve with sparse sets S of moduli which are in a sense well-distributed in arithmetic progressions. We then use this result together with Fourier techniques to obtain large sieve bounds for the case when S consists of squares. These bounds improve a recent result by L. Zhao.
The large sieve with sparse sets of moduli
Bounding sums of the Möbius function over arithmetic progressions
Explicit bounds for primes in arithmetic progressions
![QR code for arXiv:math/0512228 [math.NT]](http://oss.arxitics.com/images/favicon.svg)