arXiv:1710.01091 [math.NT]AbstractReferencesReviewsResources
Exponential sums with automatic sequences
Sary Drappeau, Clemens Müllner
Published 2017-10-03Version 1
We show that automatic sequences are asymptotically orthogonal to periodic exponentials of type $e_q(f(n))$, where $f$ is a rational fraction, in the P\'olya-Vinogradov range. This applies to Kloosterman sums, and may be used to study solubility of congruence equations over automatic sequences. We obtain this as consequence of a general result, stating that sums over automatic sequences can be bounded effectively in terms of two-point correlation sums over intervals.
Comments: 14 pages
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:math/0501530 [math.NT] (Published 2005-01-29)
On Estimates of Exponential Sums
arXiv:1705.08979 [math.NT] (Published 2017-05-24)
Automatic sequences and generalised polynomials
arXiv:1411.1739 [math.NT] (Published 2014-10-21)
A generalization of Gallagher's lemma for exponential sums