Thue-Morse sequence

From Wikipedia, the free encyclopedia

You have new messages (last change).

In mathematics and its applications, the Thue-Morse sequence, or Prouhet-Thue-Morse sequence, is a certain binary sequence whose initial segments alternate (in a certain sense).

The Thue-Morse sequence begins:

01101001100101101001011001101001...

However, sometimes other symbols are used besides 0 and 1, such as 1 and 2, or 1 and 0 (in the opposite order), or left and right, up and down, etc. Thus one may speak of the Thue-Morse sequence on a given ordered pair.

Contents

[edit] Definition

There are several equivalent ways of defining the Thue-Morse sequence.

[edit] Direct definition

To compute the nth element tn, write the number n in binary. If the number of ones in this binary expansion is odd then tn = 1, if even then tn = 0. For this reason John H. Conway et al. call numbers n satisfying tn = 1 odious numbers and numbers for which tn = 0 evil numbers.

[edit] Recurrence relation

The Thue-Morse sequence is the sequence tn satisfying t0 = 0 and

t2n = tn
t2n + 1 = 1 − tn

for all positive integers n.

[edit] L-system

The Thue-Morse sequence is the output of the following Lindenmayer system:

  variables  0  1
  constants  none
  start      0
  rules      (0 → 01), (1 → 10)

[edit] Characterization using bitwise negation

The Thue-Morse sequence in the form given above, as a sequence of bits, can be defined recursively using the operation of bitwise negation. So, the first element is 0. Then once the first 2n elements have been specified, forming a string s, then the next 2n elements must form the bitwise negation of s. Now we have defined the first 2n+1 elements, and we recurse.

Spelling out the first few steps in detail:

  • We start with 0.
  • The bitwise negation of 0 is 1.
  • Combining these, the first 2 elements are 01.
  • The bitwise negation of 01 is 10.
  • Combining these, the first 4 elements are 0110.
  • The bitwise negation of 0110 is 1001.
  • Combining these, the first 8 elements are 01101001.
  • And so on.

[edit] Infinite product

The sequence can also be defined by:

\prod_{i=0}^{} (1 - x^{2^{i}}) = \sum_{j=0}^{\infty} (-1)^{t_j} x^{j} \mbox{,} \!

where tj is the jth element if we start at j = 0.

[edit] Some properties

Because each new block in the Thue-Morse sequence is defined by forming the bitwise negation of the beginning, and this is repeated at the beginning of the next block, the Thue-Morse sequence is filled with squares: consecutive strings that are repeated. That is, there are many instances of XX, where X is some string. However, there are no cubes: instances of XXX. There are also no overlapping squares: instances of 0X0X0 or 1X1X1.

The statement above that the Thue-Morse sequence is "filled with squares" can be made precise: It is a recurrent sequence, meaning that given any finite string X in the sequence, there is some length nX (often much longer than the length of X) such that X appears in every block of length n. The easiest way to make a recurrent sequence is to form a periodic sequence, one where the sequence repeats entirely after a given number m of steps. Then nX can be set to any multiple of m that is larger than twice the length of X. But the Morse sequence is recurrent without being periodic, nor even eventually periodic (meaning periodic after some nonperiodic initial segment).

One can define a function f from the set of binary sequences to itself by replacing every 0 in a sequence with 01 and every 1 with 10. Then if T is the Thue-Morse sequence, then f(T) is T again; that is, T is a fixed point of f. In fact, T is essentially the only fixed point of f; the only other fixed point is the bitwise negation of T, which is simply the Thue-Morse sequence on (1,0) instead of on (0,1). This property may be generated to the concept of an automatic sequence.

[edit] In combinatorial game theory

The set of evil numbers (numbers n with tn = 0) forms a subspace of the nonnegative integers under nim-addition (bitwise exclusive or). For the game of Kayles, the evil numbers form the sparse space—the subspace of nim-values which occur for few (finitely many) positions in the game—and the odious numbers are the common coset.

[edit] The Prouhet-Tarry-Escott Problem

The Prouhet-Tarry-Escott Problem can be defined as: partition the set of all integers from 0 to N into two disjunct subsets S0 and S1, such that

\sum_{n \in S0} n^k = \sum_{n \in S1} n^k

This equation is true if

  • N is a power of 2,
  • and S0 contains all n (n<N) for which tn=0, S1 contains all n (n<N) for which tn=1.
  • and k=0...ld(N+1)


[edit] History

The Thue-Morse sequence was first studied by P. Prouhet in 1851, who applied it to number theory. However, Prouhet did not mention the sequence explicitly; this was left to Axel Thue in 1906, who used it to found the study of combinatorics on words. Since Thue published in German, his work was ignored at first; the sequence was only brought to worldwide attention with the work of Marston Morse in 1921, when he applied it to differential geometry. The sequence has been discovered independently many times, not always by professional research mathematicians; for example, Max Euwe, a chess grandmaster and mathematics teacher, discovered it in 1929 in an application to chess: by using its cube-free property (see above), he showed how to circumvent a rule aimed at preventing infinitely protracted games by declaring repetition of moves a draw.

[edit] See also

[edit] External links

Retrieved from "http://en.wikipedia.org../../../t/h/u/Thue-Morse_sequence_cc2a.html"