Thue-morse Sequence Website Links For
Sequence 		 

Information About

Thue-morse Sequence
  CATEGORIES ABOUT THUE-MORSE SEQUENCE
   
combinatorics
   
integer sequences
   
fixed points
   
APPAREL
BABY
BEAUTY
BOOKS
CAR TOYS
CELL PHONES
DVD'S
ELECTRONICS
GOURMET FOOD
GROCERIES
HEALTH & PERSONAL
HOME & GARDEN
JEWELRY
MUSIC
MUSIC INSTRUMENTS
OFFICE PRODUCTS
SOFTWARE
SPORTING GOODS
TOOLS & HARDWARE
TOYS
VIDEO GAMES
SHOPPING HOME
MORE SHOPPING...



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 .


DEFINITION


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


Direct definition


To compute the nth element t_n, write the number n in binary. If the number of ones in this binary expansion is odd then t_n=1, if even then t_n=0. For this reason John Conway et al. call numbers n satisfying t_n=1 ''od''ious numbers and numbers for which t_n=0 '''''ev''il''' numbers.


Recurrence relation


The Thue-Morse sequence is the sequence t_n satisfying t_0 = 0 and

:t_{2n} = t_n
:t_{2n+1} = 1-t_n

for all positive integers n.


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)


Characterization using bitwise negation


The Thue-Morse sequence in the form given above, as a sequence of Bit s, can be defined Recursive ly 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.



Infinite product


The sequence can also be defined by:
: \prod_{i=0}^{\infty} (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.


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 .


In Combinatorial Game Theory


The set of ''evil numbers'' (numbers n with t_n=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-value s which occur for few (finitely many) positions in the game—and the odious numbers are the Common Coset .


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.


SEE ALSO



EXTERNAL LINKS