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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study exponential sums of the form $$\Sigma_{n=1}^N\;e^{{2\pi}iab^{n}/m}$$Σn=1Ne2πiabn/m for nonzero integers a, b, m. Classically, non-trivial bounds were known for N ≥ √m by Korobov, and this range has been extended significantly by Bourgain as a result of his and others’ work on the sum-product phenomenon. Let P be a finite set of primes and let m be a large integer whose primes factors all belong to P. We use a variant of the Weyl-van der Corput method of differencing to give more explicit bounds that become non-trivial around the time when exp(log m/ log2 logm) ≤ N. We include applications to the digits of rational numbers and constructions of normal numbers.

Differencing methods for Korobov-type exponential sums