Permutation Complexity of the Thue-Morse Word
Abstract
Given a countable set X (usually taken to be the natural numbers or the integers), an infinite permutation π of X is a linear ordering of X. This paper investigates the combinatorial complexity of the infinite permutation on the natural numbers associated with the well-known and well-studied Thue-Morse word. A formula for the complexity is established by studying patterns in subpermutations and the action of the Thue-Morse morphism on the subpermutations.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.