Thue–Morse sequence

This graphic demonstrates the repeating and complementary makeup of the Thue–Morse sequence.

In mathematics, the Thue–Morse or Prouhet–Thue–Morse sequence is the binary sequence (an infinite sequence of 0s and 1s) that can be obtained by starting with 0 and successively appending the Boolean complement of the sequence obtained thus far. ^[1] It is sometimes called the fair share sequence because of its applications to fair division or parity sequence. The first few steps of this procedure yield the strings 0, 01, 0110, 01101001, 0110100110010110, and so on, which are the prefixes of the Thue–Morse sequence. The full sequence begins:

01101001100101101001011001101001.... ^[1]

The sequence is named after Axel Thue and Marston Morse.

Definition

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

Direct definition

When counting in binary, the digit sum modulo 2 is the Thue–Morse sequence

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. ^[2] That is, t_n is the even parity bit for n. John H. Conway et al. deemed numbers n satisfying t_n = 1 to be odious (intended to be similar to odd) numbers, and numbers for which t_n = 0 to be evil (similar to even) numbers.

Fast sequence generation

This method leads to a fast method for computing the Thue–Morse sequence: start with t₀ = 0, and then, for each n, find the highest-order bit in the binary representation of n that is different from the same bit in the representation of n − 1. If this bit is at an even index, t_n differs from t_n − 1, and otherwise it is the same as t_n − 1.

In Python:

defgenerate_sequence(seq_length:int):"""Thue–Morse sequence."""value=1forninrange(seq_length):# Note: assumes that (-1).bit_length() gives 1x=(n^(n-1)).bit_length()+1ifx&1==0:# Bit index is even, so toggle valuevalue=1-valueyieldvalue

The resulting algorithm takes constant time to generate each sequence element, using only a logarithmic number of bits (constant number of words) of memory. ^[3]

Recurrence relation

The Thue–Morse sequence is the sequence t_n satisfying the recurrence relation

${\displaystyle {\begin{aligned}t_{0}&=0,\\t_{2n}&=t_{n},\\t_{2n+1}&=1-t_{n},\end{aligned}}}$

for all non-negative integers n. ^[2]

L-system

Thue–Morse sequence generated by an L-System

The Thue–Morse sequence is a morphic word: ^[4] it 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 bits, can be defined recursively using the operation of bitwise negation. So, the first element is 0. Then once the first 2ⁿ elements have been specified, forming a string s, then the next 2ⁿ elements must form the bitwise negation of s. Now we have defined the first 2ⁿ⁺¹ 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.

So

• T₀ = 0.
• T₁ = 01.
• T₂ = 0110.
• T₃ = 01101001.
• T₄ = 0110100110010110.
• T₅ = 01101001100101101001011001101001.
• T₆ = 0110100110010110100101100110100110010110011010010110100110010110.
• And so on.

In Python:

defthue_morse_bits(n):"""Return an int containing the first 2**n bits of the Thue-Morse sequence, low-order bit 1st."""bits=0foriinrange(n):bits|=((1<<(1<<i))-1-bits)<<(1<<i)returnbits

Which can then be converted to a (reversed) string as follows:

n=7print(f"{thue_morse_bits(n):0{1<<n}b}")

Infinite product

The sequence can also be defined by:

${\displaystyle \prod _{i=0}^{\infty }\left(1-x^{2^{i}}\right)=\sum _{j=0}^{\infty }(-1)^{t_{j}}x^{j},}$

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

Properties

The Thue–Morse sequence contains many squares: instances of the string ${\displaystyle XX}$, where ${\displaystyle X}$ denotes the string ${\displaystyle A}$, ${\displaystyle {\overline {A}}}$, ${\displaystyle A{\overline {A}}A}$, or ${\displaystyle {\overline {A}}A{\overline {A}}}$, where ${\displaystyle A=T_{k}}$ for some ${\displaystyle k\geq 0}$ and ${\displaystyle {\overline {A}}}$ is the bitwise negation of ${\displaystyle A}$. ^[5] For instance, if ${\displaystyle k=0}$, then ${\displaystyle A=T_{0}=0}$. The square ${\displaystyle A{\overline {A}}AA{\overline {A}}A=010010}$ appears in ${\displaystyle T}$ starting at the 16th bit. Since all squares in ${\displaystyle T}$ are obtained by repeating one of these 4 strings, they all have length ${\displaystyle 2^{n}}$ or ${\displaystyle 3\cdot 2^{n}}$ for some ${\displaystyle n\geq 0}$. ${\displaystyle T}$ contains no cubes: instances of ${\displaystyle XXX}$. There are also no overlapping squares: instances of ${\displaystyle 0X0X0}$ or ${\displaystyle 1X1X1}$. ^{[6] [7]} The critical exponent of ${\displaystyle T}$ is 2. ^[8]

The Thue–Morse sequence is a uniformly recurrent word: given any finite string X in the sequence, there is some length n_X (often much longer than the length of X) such that X appears in every block of length n_X. ^{[9] [10]} Notably, the Thue-Morse sequence is uniformly recurrent without being either periodic or eventually periodic (i.e., periodic after some initial nonperiodic segment). ^[11]

The sequence T_2n is a palindrome for any n. Furthermore, let q_n be a word obtained by counting the ones between consecutive zeros in T_2n . For instance, q₁ = 2 and q₂ = 2102012. Since T_n does not contain overlapping squares, the words q_n are palindromic squarefree words.

The Thue–Morse morphism μ is defined on alphabet {0,1} by the substitution map μ(0) = 01, μ(1) = 10: every 0 in a sequence is replaced with 01 and every 1 with 10. ^[12] If T is the Thue–Morse sequence, then μ(T) is also T. Thus, T is a fixed point of μ. The morphism μ is a prolongable morphism on the free monoid {0,1}^∗ with T as fixed point: T is essentially the only fixed point of μ; 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 generalized to the concept of an automatic sequence.

The generating series of T over the binary field is the formal power series

${\displaystyle t(Z)=\sum _{n=0}^{\infty }T(n)Z^{n}\ .}$

This power series is algebraic over the field of rational functions, satisfying the equation ^[13]

${\displaystyle Z+(1+Z)^{2}t+(1+Z)^{3}t^{2}=0}$

In combinatorial game theory

The set of evil numbers (numbers ${\displaystyle n}$ with ${\displaystyle t_{n}=0}$) forms a subspace of the nonnegative integers under nim-addition (bitwise exclusive or). For the game of Kayles, evil nim-values occur for few (finitely many) positions in the game, with all remaining positions having odious nim-values.

The Prouhet–Tarry–Escott problem

The Prouhet–Tarry–Escott problem can be defined as: given a positive integer N and a non-negative integer k, partition the set S = { 0, 1, ..., N-1 } into two disjoint subsets S₀ and S₁ that have equal sums of powers up to k, that is:

${\displaystyle \sum _{x\in S_{0}}x^{i}=\sum _{x\in S_{1}}x^{i}}$ for all integers i from 1 to k.

This has a solution if N is a multiple of 2^k+1, given by:

• S₀ consists of the integers n in S for which t_n = 0,
• S₁ consists of the integers n in S for which t_n = 1.

For example, for N = 8 and k = 2,

0 + 3 + 5 + 6 = 1 + 2 + 4 + 7,

0² + 3² + 5² + 6² = 1² + 2² + 4² + 7².

The condition requiring that N be a multiple of 2^k+1 is not strictly necessary: there are some further cases for which a solution exists. However, it guarantees a stronger property: if the condition is satisfied, then the set of kth powers of any set of N numbers in arithmetic progression can be partitioned into two sets with equal sums. This follows directly from the expansion given by the binomial theorem applied to the binomial representing the nth element of an arithmetic progression.

For generalizations of the Thue–Morse sequence and the Prouhet–Tarry–Escott problem to partitions into more than two parts, see Bolker, Offner, Richman and Zara, "The Prouhet–Tarry–Escott problem and generalized Thue–Morse sequences". ^[14]

Fractals and turtle graphics

Using turtle graphics, a curve can be generated if an automaton is programmed with a sequence. When Thue–Morse sequence members are used in order to select program states:

• If t(n) = 0, move ahead by one unit,
• If t(n) = 1, rotate by an angle of π/3 radians (60°)

The resulting curve converges to the Koch curve, a fractal curve of infinite length containing a finite area. This illustrates the fractal nature of the Thue–Morse Sequence. ^[15]

It is also possible to draw the curve precisely using the following instructions: ^[16]

• If t(n) = 0, rotate by an angle of π radians (180°),
• If t(n) = 1, move ahead by one unit, then rotate by an angle of π/3 radians.

Equitable sequencing

In their book on the problem of fair division, Steven Brams and Alan Taylor invoked the Thue–Morse sequence but did not identify it as such. When allocating a contested pile of items between two parties who agree on the items' relative values, Brams and Taylor suggested a method they called balanced alternation, or taking turns taking turns taking turns . . . , as a way to circumvent the favoritism inherent when one party chooses before the other. An example showed how a divorcing couple might reach a fair settlement in the distribution of jointly-owned items. The parties would take turns to be the first chooser at different points in the selection process: Ann chooses one item, then Ben does, then Ben chooses one item, then Ann does. ^[17]

Lionel Levine and Katherine E. Stange, in their discussion of how to fairly apportion a shared meal such as an Ethiopian dinner, proposed the Thue–Morse sequence as a way to reduce the advantage of moving first. They suggested that “it would be interesting to quantify the intuition that the Thue–Morse order tends to produce a fair outcome.” ^[18]

Robert Richman addressed this problem, but he too did not identify the Thue–Morse sequence as such at the time of publication. ^[19] He presented the sequences T_n as step functions on the interval [0,1] and described their relationship to the Walsh and Rademacher functions. He showed that the nth derivative can be expressed in terms of T_n. As a consequence, the step function arising from T_n is orthogonal to polynomials of order n − 1. A consequence of this result is that a resource whose value is expressed as a monotonically decreasing continuous function is most fairly allocated using a sequence that converges to Thue–Morse as the function becomes flatter. An example showed how to pour cups of coffee of equal strength from a carafe with a nonlinear concentration gradient, prompting a whimsical article in the popular press. ^[20]

Joshua Cooper and Aaron Dutle showed why the Thue–Morse order provides a fair outcome for discrete events. ^[21] They considered the fairest way to stage a Galois duel, in which each of the shooters has equally poor shooting skills. Cooper and Dutle postulated that each dueler would demand a chance to fire as soon as the other's a priori probability of winning exceeded their own. They proved that, as the duelers’ hitting probability approaches zero, the firing sequence converges to the Thue–Morse sequence. In so doing, they demonstrated that the Thue–Morse order produces a fair outcome not only for sequences T_n of length 2ⁿ, but for sequences of any length.

Thus the mathematics supports using the Thue–Morse sequence instead of alternating turns when the goal is fairness but earlier turns differ monotonically from later turns in some meaningful quality, whether that quality varies continuously ^[19] or discretely. ^[21]

Sports competitions form an important class of equitable sequencing problems, because strict alternation often gives an unfair advantage to one team. Ignacio Palacios-Huerta proposed changing the sequential order to Thue–Morse to improve the ex post fairness of various tournament competitions, such as the kicking sequence of a penalty shoot-out in soccer. ^[22] He did a set of field experiments with pro players and found that the team kicking first won 60% of games using ABAB (or T₁), 54% using ABBA (or T₂), and 51% using full Thue–Morse (or T_n).  As a result, ABBA is undergoing extensive trials in FIFA (European and World Championships) and English Federation professional soccer (EFL Cup). ^[23] An ABBA serving pattern has also been found to improve the fairness of tennis tie-breaks. ^[24] In competitive rowing, T₂ is the only arrangement of port- and starboard-rowing crew members that eliminates transverse forces (and hence sideways wiggle) on a four-membered coxless racing boat, while T₃ is one of only four rigs to avoid wiggle on an eight-membered boat. ^[25]

Fairness is especially important in player drafts. Many professional sports leagues attempt to achieve competitive parity by giving earlier selections in each round to weaker teams. By contrast, fantasy football leagues have no pre-existing imbalance to correct, so they often use a “snake” draft (forward, backward, etc.; or T₁). ^[26] Ian Allan argued that a “third-round reversal” (forward, backward, backward, forward, etc.; or T₂) would be even more fair. ^[27] Richman suggested that the fairest way for “captain A” and “captain B” to choose sides for a pick-up game of basketball mirrors T₃: captain A has the first, fourth, sixth, and seventh choices, while captain B has the second, third, fifth, and eighth choices. ^[19]

Hash collisions

The initial 2^k bits of the Thue–Morse sequence are mapped to 0 by a wide class of polynomial hash functions modulo a power of two, which can lead to hash collisions. ^[28]

Riemann zeta function

Certain linear combinations of Dirichlet series whose coefficients are terms of the Thue–Morse sequence give rise to identities involving the Riemann Zeta function (Tóth, 2022 ^[29] ). For instance:

${\displaystyle {\begin{aligned}\sum _{n\geq 1}{\frac {5t_{n-1}+3t_{n}}{n^{2}}}&=4\zeta (2)={\frac {2\pi ^{2}}{3}},\\\sum _{n\geq 1}{\frac {9t_{n-1}+7t_{n}}{n^{3}}}&=8\zeta (3),\end{aligned}}}$

where ${\displaystyle (t_{n})_{n\geq 0}}$ is the ${\displaystyle n^{\rm {th}}}$ term of the Thue-Morse sequence. In fact, for all ${\displaystyle s}$ with real part greater than ${\displaystyle 1}$, we have

${\displaystyle (2^{s}+1)\sum _{n\geq 1}{\frac {t_{n-1}}{n^{s}}}+(2^{s}-1)\sum _{n\geq 1}{\frac {t_{n}}{n^{s}}}=2^{s}\zeta (s).}$

History

The Thue–Morse sequence was first studied by Eugène Prouhet  [ fr ] in 1851, ^[30] 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. 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 the threefold repetition rule aimed at preventing infinitely protracted games by declaring repetition of moves a draw. At the time, consecutive identical board states were required to trigger the rule; the rule was later amended to the same board position reoccurring three times at any point, as the sequence shows that the consecutive criterion can be evaded forever.

See also

• Dejean's theorem
• Fabius function
• First difference of the Thue–Morse sequence
• Gray code ^{[31] [32]}
• Komornik–Loreti constant
• Prouhet–Thue–Morse constant

Notes

1. Sloane, N. J. A. (ed.). "SequenceA010060(Thue-Morse sequence)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
2. Allouche & Shallit (2003 , p. 15)
3. Arndt (2011).
4. Lothaire (2011 , p. 11)
5. Brlek (1989).
6. Lothaire (2011 , p. 113)
7. Pytheas Fogg (2002 , p. 103)
8. Krieger (2006).
9. Lothaire (2011 , p. 30)
10. Berthé & Rigo (2010).
11. Lothaire (2011 , p. 31)
12. Berstel et al. (2009 , p. 70)
13. Berstel et al. (2009 , p. 80)
14. Bolker et al. (2016).
15. Ma & Holdener (2005).
16. Abel, Zachary (January 23, 2012). "Thue-Morse Navigating Turtles". Three-Cornered Things.
17. Brams & Taylor (1999).
18. Levine & Stange (2012).
19. Richman (2001)
20. Abrahams (2010).
21. Cooper & Dutle (2013)
22. Palacios-Huerta (2012).
23. Palacios-Huerta (2014).
24. Cohen-Zada, Krumer & Shapir (2018).
25. Barrow (2010).
26. "Fantasy Draft Types". NFL.com . Archived from the original on October 12, 2018.
27. Allan, Ian (July 16, 2014). "Third-Round Reversal Drafts". Fantasy Index. Retrieved September 1, 2020.
28. Pachocki, Jakub; Radoszewski, Jakub (2013). "Where to Use and How not to Use Polynomial String Hashing" (PDF). Olympiads in Informatics. 7: 90–100.
29. Tóth, László (2022). "Linear Combinations of Dirichlet Series Associated with the Thue-Morse Sequence". Integers. 22 (article 98). arXiv: 2211.13570 .
30. The ubiquitous Prouhet-Thue-Morse sequence by Jean-Paul Allouche and Jeffrey Shallit
31. Fredricksen, Harold (1992). "Gray codes and the Thue-Morse-Hedlund sequence". Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC). 11. Naval Postgraduate School, Department of Mathematics, Monterey, California, USA: 3–11.
32. Erickson, John (2018-10-30). "On the Asymptotic Relative Change for Sequences of Permutations" . Retrieved 2021-01-31.

References

• Abrahams, Marc (12 July 2010). "How to pour the perfect cup of coffee". The Guardian.
• Arndt, Jörg (2011). "1.16.4 The Thue–Morse sequence" (PDF). Matters Computational: Ideas, Algorithms, Source Code. Springer. p. 44.
• Allouche, Jean-Paul; Shallit, Jeffrey (2003). Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press. ISBN   978-0-521-82332-6. Zbl   1086.11015.
• Barrow, John D. (2010). "Rowing and the Same-Sum Problem Have Their Moments". American Journal of Physics . 78 (7): 728–732. arXiv: 0911.3551 . Bibcode:2010AmJPh..78..728B. doi:10.1119/1.3318808. S2CID   119207447.
• Berstel, Jean; Lauve, Aaron; Reutenauer, Christophe; Saliola, Franco V. (2009). Combinatorics on words. Christoffel words and repetitions in words. CRM Monograph Series. Vol. 27. Providence, RI, USA: American Mathematical Society. ISBN   978-0-8218-4480-9. Zbl   1161.68043.
• Berthé, Valérie; Rigo, Michel, eds. (2010). Combinatorics, automata, and number theory. Encyclopedia of Mathematics and its Applications. Vol. 135. Cambridge: Cambridge University Press. p. 7. ISBN   978-0-521-51597-9. Zbl   1197.68006.
• Bolker, Ethan; Offner, Carl; Richman, Robert; Zara, Catalin (2016). "The Prouhet–Tarry–Escott problem and generalized Thue–Morse sequences". Journal of Combinatorics. 7 (1): 117–133. arXiv: 1304.6756 . doi:10.4310/JOC.2016.v7.n1.a5. S2CID   118040795.}
• Brams, Steven J.; Taylor, Alan D. (1999). The Win-Win Solution: Guaranteeing Fair Shares to Everybody . W. W. Norton & Co., Inc. pp.  36–44. ISBN   978-0-393-04729-5.
• Brlek, Srećko (1989). "Enumeration of Factors in the Thue-Morse Word". Discrete Applied Mathematics . 24 (1–3): 83–96. doi:10.1016/0166-218x(92)90274-e.
• Cohen-Zada, Danny; Krumer, Alex; Shapir, Offer Moshe (2018). "Testing the effect of serve order in tennis tiebreak". Journal of Economic Behavior and Organization . 146: 106–115. doi:10.1016/j.jebo.2017.12.012. S2CID   89610106.
• Cooper, Joshua; Dutle, Aaron (2013). "Greedy Galois Games" (PDF). American Mathematical Monthly . 120 (5): 441–451. arXiv: 1110.1137 . doi:10.4169/amer.math.monthly.120.05.441. S2CID   1291901.
• Krieger, Dalia (2006). "On critical exponents in fixed points of non-erasing morphisms". In Ibarra, Oscar H.; Dang, Zhe (eds.). Developments in Language Theory: Proceedings 10th International Conference, DLT 2006, Santa Barbara, California, USA, June 26-29, 2006. Lecture Notes in Computer Science. Vol. 4036. Springer-Verlag. pp. 280–291. ISBN   978-3-540-35428-4. Zbl   1227.68074.
• Levine, Lionel; Stange, Katherine E. (2012). "How to Make the Most of a Shared Meal: Plan the Last Bite First" (PDF). American Mathematical Monthly . 119 (7): 550–565. arXiv: 1104.0961 . doi:10.4169/amer.math.monthly.119.07.550. S2CID   14537479.
• Lothaire, M. (2011). Algebraic combinatorics on words. Encyclopedia of Mathematics and Its Applications. Vol. 90. With preface by Jean Berstel and Dominique Perrin (Reprint of the 2002 hardback ed.). Cambridge University Press. ISBN   978-0-521-18071-9. Zbl   1221.68183.
• Ma, Jun; Holdener, Judy (2005). "When Thue-Morse meets Koch" (PDF). Fractals . 13 (3): 191–206. doi:10.1142/S0218348X05002908. MR   2166279.
• Palacios-Huerta, Ignacio (2012). "Tournaments, fairness and the Prouhet–Thue–Morse sequence" (PDF). Economic Inquiry. 50 (3): 848–849. doi:10.1111/j.1465-7295.2011.00435.x. S2CID   54036493.
• Palacios-Huerta, Ignacio (2014). Beautiful Game Theory. Princeton University Press. ISBN   978-0691144023.
• Pytheas Fogg, N. (2002). Berthé, Valérie; Ferenczi, Sébastien; Mauduit, Christian; Siegel, A. (eds.). Substitutions in dynamics, arithmetics and combinatorics. Lecture Notes in Mathematics. Vol. 1794. Berlin, Germany: Springer-Verlag. ISBN   978-3-540-44141-0. Zbl   1014.11015.
• Richman, Robert (2001). "Recursive Binary Sequences of Differences" (PDF). Complex Systems . 13 (4): 381–392.

Further reading

• Bugeaud, Yann (2012). Distribution modulo one and Diophantine approximation. Cambridge Tracts in Mathematics. Vol. 193. Cambridge: Cambridge University Press. ISBN   978-0-521-11169-0. Zbl   1260.11001.
• Lothaire, M. (2005). Applied combinatorics on words . Encyclopedia of Mathematics and Its Applications. Vol. 105. A collective work by Jean Berstel, Dominique Perrin, Maxime Crochemore, Eric Laporte, Mehryar Mohri, Nadia Pisanti, Marie-France Sagot, Gesine Reinert, Sophie Schbath, Michael Waterman, Philippe Jacquet, Wojciech Szpankowski, Dominique Poulalhon, Gilles Schaeffer, Roman Kolpakov, Gregory Koucherov, Jean-Paul Allouche and Valérie Berthé. Cambridge: Cambridge University Press. ISBN   978-0-521-84802-2. Zbl   1133.68067.

External links

• "Thue-Morse sequence", Encyclopedia of Mathematics , EMS Press, 2001 [1994]
• Weisstein, Eric W. "Thue-Morse Sequence". MathWorld .
• Allouche, J.-P.; Shallit, J. O. The Ubiquitous Prouhet-Thue-Morse Sequence. (contains many applications and some history)
• Thue–Morse Sequence over (1,2) (sequence A001285 in the OEIS )
• OEIS sequenceA000069(Odious numbers: numbers with an odd number of 1's in their binary expansion)
• OEIS sequenceA001969(Evil numbers: numbers with an even number of 1's in their binary expansion)
• Reducing the influence of DC offset drift in analog IPs using the Thue-Morse Sequence. A technical application of the Thue–Morse Sequence
• MusiNum - The Music in the Numbers. Freeware to generate self-similar music based on the Thue–Morse Sequence and related number sequences.
• Parker, Matt. "The Fairest Sharing Sequence Ever" (video). standupmaths. Retrieved 20 January 2016.