Exponential sums with automatic sequences

DOI10.4064/AA171002-20-3MaRDI QIDQ4963274zbMATH OpenOpenAlexWikidataFDO

Authors Sary Drappeau, Clemens Müllner

Publication date 1 November 2018

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.01091

zbMATH Keywords

automatic sequencesexponential sumsWeil bound

Mathematics Subject Classification ID

Automata sequences (11B85) Gauss and Kloosterman sums; generalizations (11L05) Estimates on exponential sums (11L07) Sums over arbitrary intervals (11L26)

Abstract: 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.

Recommendations

• Differencing methods for Korobov-type exponential sums
• Exponential sums for nonlinear recurring sequences
• À la recherche de petites sommes d'exponentielles. (In search of small exponential sums)
• On multiplicative automatic sequences
• Lower bounds of exponential sums

Cites work

• Automatic Sequences
• Character sums over integers with restricted g-ary digits
• scientific article; zbMATH DE number 7422485 (Why is no real title available?)
• Multiplicative character sums and products of sparse integers in residue classes
• New equidistribution estimates of Zhang type
• On Some Exponential Sums

Cited in

(2)

• Chowla and Sarnak conjectures for Kloosterman sums
• Kloosterman sums do not correlate with periodic functions

This page was built for publication: Exponential sums with automatic sequences

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