English

Exponential sums with automatic sequences

Number Theory 2017-10-04 v1

Abstract

We show that automatic sequences are asymptotically orthogonal to periodic exponentials of type eq(f(n))e_q(f(n)), where ff 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.

Keywords

Cite

@article{arxiv.1710.01091,
  title  = {Exponential sums with automatic sequences},
  author = {Sary Drappeau and Clemens Müllner},
  journal= {arXiv preprint arXiv:1710.01091},
  year   = {2017}
}

Comments

14 pages

R2 v1 2026-06-22T22:02:13.404Z