On a sequence related to that of Thue-Morse and its applications (Q870969): Difference between revisions

Let \((a_b)\) be the sequence of runlengths of the famous Thue-Morse sequence, i.e., \((a_n)= 1\,2\,1\,1\,2\,2\,2\,1\,1\,2\dots\). Using the generating function of this sequence and tools from combinatorics on words, the author obtains nice results in distribution modulo 1. For example: for any real number \(\varepsilon\neq 0\), the sequence \(\{\varepsilon(-{3\over 2})^n\}\) has a limit point larger than 0.466. Please note the reference [2] appeared [Ann. Math. (2) 165, 547--565 (2007; Zbl 1195.11094)].