scientific article; zbMATH DE number 2186861

From MaRDI portal
Publication:3023979





Consider the following sequence \(\{t_k(n)\}\): For \(k \geq 2\), \( t_k(n) = s_k(n) \bmod{2}\) where \(s_k(n)\) is the sum of digits in the base-\(k\) representation of a nonnegative integer \(n\). The special case \(k = 2\) is the well-known Thue-Morse sequence. Recently, Allouche et al. investigated palindromes in the sequences \(\{t_k(n)\}\), that is, sequences of binary digits that read the same forward and backward. They proved that for all \(k \geq 2\), \(\{t_k(n)\}\) contains palindromes of arbitrary length. They determined the ``change sequence corresponding to the Thue-Morse sequence, that is, the sequence that encodes the positions at which the sequence changes values. In this paper, the author generalizes these results to a larger class of binary sequences that can be defined as fixed points of a class of maps on binary words. The author introduces the concept of the ``first difference of a binary sequence and characterizes the first differences of his class of Thue-Morse type sequences. This involves the so-called Toeplitz maps. The concept of first difference relates to that of a change sequence of a binary sequence.





Describes a project that uses

Uses Software






This page was built for publication:

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