English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We complement the argument of M. Z. Garaev (2009) with several other ideas toobtain a stronger version of the large sieve inequality with sparse exponentialsequences of the form $\lambda^{s_n}$. In particular, we obtain a result whichis non-trivial for monotonically increasing sequences $\cal{S}=\{s_n\}_{n=1}^{\infty}$ provided $s_n\le n^{2+o(1)}$, whereas the original argumentof M. Z. Garaev requires $s_n \le n^{15/14 +o(1)}$ in the same setting. We alsogive an application of our result to arithmetic properties of integers withalmost all digits prescribed.

On the exponential large sieve inequality for sparse sequences modulo primes