Gowers norms for automatic sequences
The important inverse theorem for Gowers uniformity norms due to \textit{B. Green} et al. [Ann. Math. (2) 176, No. 2, 1231--1372 (2012; Zbl 1282.11007)] relates lack of correlation with nilsequences of bounded complexity to small Gowers norm. Here different but conceptually related ideas are used to show how an automatic sequence (that is, a sequence computable by a finite automata) can be decomposed into a highly structured part (a rationally almost periodic part) and a Gowers uniform part in a particularly efficient way. \N\NThe first main result is that if \(a\) is an automatic complex-valued sequence with \[ \lim_{N\to\infty}\frac{1}{N} \sum_{n=0}^{N-1}a_nb_n=0 \] for any periodic sequence \(b\) (that is \(a\) is not correlated with periodic sequences) then \(a\) is highly Gowers uniform. \N\NSubsequent results show decompositions of automatic sequences under various conditions on the generating automata into rationally almost periodic and highly Gowers uniform parts. \N\NAn application of the results is to find lower bounds on the number of \(\ell\)-term arithmetic progressions in \(A\) with give difference for an automatic set \(A\).
This page was built for publication: Gowers norms for automatic sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962341)
