Thue-Morse sequence

A sequence appearing in numerous fields and discovered and rediscovered in different contexts.

Arithmetical definition.

The Thue–Morse sequence is defined as the sequence which counts the sum modulo of the digits of in base ( gives the parity of the number of s in the binary expansion of ). This sequence can also be generated by an iterative process called substitution. Let and let denote the set of words defined on the alphabet (cf. also Word). Consider the mapping defined by and . The mapping extends to a morphism of by concatenation. One can iterate , and the nested words converge in the product topology to the infinite sequence which begins with , for every . This sequence is precisely the Thue–Morse sequence.

This sequence was first discovered by E. Prouhet in 1851 as a solution of the so-called Prouhet–Tarry–Escott problem (G. Tarry and E.B. Escott re-introduced this problem after Prouhet in the years 1910–1920): Consider a finite set of integers that can be partitioned into classes with the same cardinality such that the sums of the elements, the sums of squares, etc., the sums of the th powers in each class, are independent of the class. If the sums of the th powers are not equal, then the solution is said to be an exact solution of order . The Thue–Morse sequence provides a solution of degree exactly (when ) by considering the classes and . Note that this partition is conjectured to be the unique partition of the set into classes providing an exact solution of degree . For more results on this subject, see [a1].

The sequence was next rediscovered by A. Thue in 1912 [a7]. Thue tried to construct arbitrarily long words on a two-letter alphabet without cubes, i.e., without factors of the form , where is a non-empty word. It is easily seen that there are no infinite square-free sequences on two letters. It is then natural to ask whether there are infinite sequences free of powers , for any . Such a sequence is called overlap-free; in other words, none of its factors is of the form . In fact, the Thue–Morse sequence is an infinite overlap-free word on two letters. Moreover, all overlap-free words are derived from this sequence. Furthermore, if one defines the Thue–Morse sequence on (by mapping to and to ), then the sequence defined on the three-letter alphabet is square-free. By applying the morphism , , , one also gets an infinite cube-free word on two letters. These results have been extended within the theory of avoidable and unavoidable patterns in strings. Note that such combinatorial properties were used to solve various algebraic problems, and to provide a negative answer to the Burnside problem. For more information on the subject, see [a4].

The sequence was next introduced by M. Morse [a5] in 1921 in order to show the existence of non-periodic recurrent geodesics over simply-connected surfaces with constant negative curvature (cf. also Simply-connected domain; Surface; Geodesic line), by coding a geodesic by an infinite sequence of s and s, according to which boundary of the surface it meets. Indeed, the Thue–Morse sequence is a recurrent sequence, i.e., every factor appears in an infinite number of places with bounded gaps. In other words, the symbolic dynamical system generated by the Thue–Morse sequence is minimal (see, for instance, [a6] or Dynamical system).

The Thue–Morse sequence is a typical example of a -automatic sequence. Actually, like every fixed point of a substitution of constant length, it can be generated by a finite machine, called a finite automaton (cf. Automaton, finite), as follows. A -automaton is given by a finite set of states , one state being called the initial state, by mappings from into itself (denoted by ) and by an output mapping from into a given set . Such an automaton generates a sequence with values in as follows: Feed the automaton with the digits of the base- expansion of , starting with the initial state; then define as the image under of the reached state. In the Thue–Morse case, the automaton has two states, say , the mapping maps each state to itself whereas the mapping exchanges both states, the output mapping is the identity mapping and the state is the initial state.

Automatic sequences have many nice characterizations (see, for instance, [a8]). Automatic sequences are exactly the letter-to-letter images of fixed points of constant-length substitutions. Furthermore, this is equivalent to the fact that the following subset of subsequences (called the -kernel)

is finite or to the fact that the series is algebraic over , in the case is a prime power. Note that, on the other hand, the real number that has, as dyadic expansion, the Thue–Morse sequence is transcendental. For more references and connections with physics, see [a3].

Consider the sequence that counts modulo the number of s (possibly with overlap) in the base- expansion of . The sequence is easily seen to have a finite -kernel and hence to be be -automatic. This sequence was introduced independently by W. Rudin and H.S. Shapiro (see the references in [a6]) in order to minimize uniformly , for a sequence defined over . The Rudin–Shapiro sequence hence provides

The dynamical system generated by each of the two sequences and is strictly ergodic (cf. also Ergodic theory), since both underlying substitutions are primitive (see, for instance, [a6]). But, although very similar in their definition, these two sequences have very distinct spectral properties. The Morse system has a singular simple spectrum, whereas the dynamical system generated by the Rudin–Shapiro sequence provides an example of a system with finite spectral multiplicity and a Lebesgue component in the spectrum. For more references on the ergodic, spectral and harmonic properties of substitutive sequences, see [a6].

If (almost) everything is known concerning the Thue–Morse and the Rudin–Shapiro sequences, then the situation is completely different for the fascinating Kolakoski sequence. The Kolakoski sequence is the self-determined sequence defined over the alphabet as follows. The sequence begins with , and the sequence of lengths of the consecutive strings of s and s is the sequence itself. Hence this sequence is equal to For a survey of related properties and conjectures, see [a2].

References

[a1]	P. Borwein, C. Ingalls, "The Prouhet–Tarry–Escott problem revisited" Enseign. Math. , 40 (1994) pp. 3–27
[a2]	F.M. Dekking, "What is the long range order in the Kolakoski sequence" , The Mathematics Of Long-Range Aperiodic Order (Waterloo, ON, 1995) , NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. , 489 , Kluwer Acad. Publ. (1997) pp. 115–125
[a3]	"Beyond Quasicrystals: Actes de l'École de Physique Théorique des Houches" F. Axel (ed.) et al. (ed.) , Springer (1995)
[a4]	M. Lothaire, "Combinatorics on words" , Cambridge Univ. Press (1997)
[a5]	M. Morse, "Recurrent geodesics on a surface of negative curvature" Trans. Amer. Math. Soc. , 22 (1921) pp. 84–100
[a6]	M. Queffélec, "Substitution dynamical systems. Spectral analysis" , Lecture Notes Math. , 1294 , Springer (1987)
[a7]	A. Thue, "Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen" , Selected Math. Papers of Axel Thue , Universiteitsforlaget (1977) (Published in 1912)
[a8]	J.-P. Allouche, "Automates finis en théorie des nombres" Experim. Math. , 5 (1987) pp. 239–266