On the exponential large sieve inequality for sparse sequences modulo primes

From MaRDI portal



Abstract: We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form lambdasn. In particular, we obtain a result which is non-trivial for monotonically increasing sequences calS=snn=1infty provided snlen2+o(1), whereas the original argument of M. Z. Garaev requires snlen15/14+o(1) in the same setting. We also give an application of our result to arithmetic properties of integers with almost all digits prescribed.



Cites work









This page was built for publication: On the exponential large sieve inequality for sparse sequences modulo primes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684700)