Infinite self-shuffling words

Abstract In this paper we introduce and study a new property of infinite words: An infinite word x ∈ A N , with values in a finite set A , is said to be k - self-shuffling ( k ≥ 2 ) if x admits factorizations: x = ∏ i = 0 ∞ U i ( 1 ) ⋯ U i ( k ) = ∏ i = 0 ∞ U i ( 1 ) = ⋯ = ∏ i = 0 ∞ U i ( k ) . In other words, there exists a shuffle of k -copies of x which produces x . We are particularly interested in the case k = 2 , in which case we say x is self-shuffling. This property of infinite words is shown to be independent of the complexity of the word as measured by the number of distinct factors of each length. Examples exist from bounded to full complexity. It is also an intrinsic property of the word and not of its language (set of factors). For instance, every aperiodic word contains a non-self-shuffling word in its shift orbit closure. While the property of being self-shuffling is a relatively strong condition, many important words arising in the area of symbolic dynamics are verified to be self-shuffling. They include for instance the Thue–Morse word fixed by the morphism 0 ↦ 01 , 1 ↦ 10 . As another example we show that all Sturmian words of slope α ∈ R ∖ Q and intercept 0 ρ 1 are self-shuffling (while those of intercept ρ = 0 are not). Our characterization of self-shuffling Sturmian words can be interpreted arithmetically in terms of a dynamical embedding and defines an arithmetic process we call the stepping stone model . One important feature of self-shuffling words stems from their morphic invariance: The morphic image of a self-shuffling word is self-shuffling. This provides a useful tool for showing that one word is not the morphic image of another. In addition to its morphic invariance, this new notion has other unexpected applications particularly in the area of substitutive dynamical systems. For example, as a consequence of our characterization of self-shuffling Sturmian words, we recover a number theoretic result, originally due to Yasutomi, on a classification of pure morphic Sturmian words in the orbit of the characteristic.

[1]  Aldo de Luca,et al.  Sturmian Words: Structure, Combinatorics, and Their Arithmetics , 1997, Theor. Comput. Sci..

[2]  Tero Harju,et al.  Minimal Duval Extensions , 2004, Int. J. Found. Comput. Sci..

[3]  Luca Q. Zamboni,et al.  Self-shuffling Words , 2013, ICALP.

[4]  D. Henshall,et al.  Shuffling and Unshuffling , 2011, Bull. EATCS.

[5]  M. Lothaire Algebraic Combinatorics on Words , 2002 .

[6]  G. A. Hedlund,et al.  Symbolic Dynamics II. Sturmian Trajectories , 1940 .

[7]  J. Shallit,et al.  Automatic Sequences: Frequency of Letters , 2003 .

[8]  Samuel R. Buss,et al.  Unshuffling a square is NP-hard , 2014, J. Comput. Syst. Sci..

[9]  Romeo Rizzi,et al.  On Recognizing Words That Are Squares for the Shuffle Product , 2013, CSR.

[10]  Harold Marston Morse Recurrent geodesics on a surface of negative curvature , 1921 .

[11]  Fabien Durand,et al.  A characterization of substitutive sequences using return words , 1998, Discret. Math..

[12]  Jeffrey Shallit,et al.  Automatic Sequences: Theory, Applications, Generalizations , 2003 .

[13]  Rani Siromoney,et al.  Infinite Lyndon Words , 1994, Inf. Process. Lett..

[14]  Juhani Karhumäki,et al.  Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms , 1997, Eur. J. Comb..

[15]  Isabelle Fagnot A little more about morphic Sturmian words , 2006, RAIRO Theor. Informatics Appl..

[16]  M. Lothaire Combinatorics on words: Bibliography , 1997 .

[17]  Luca Q. Zamboni,et al.  A generalization of Sturmian sequences: Combinatorial structure and transcendence , 2000 .

[18]  Jean Berstel,et al.  A Rewriting of Fife's Theorem about Overlap-Free Words , 1994, Results and Trends in Theoretical Computer Science.

[19]  Symbolic dynamics , 2008, Scholarpedia.

[20]  Jeffrey Shallit,et al.  The Ubiquitous Prouhet-Thue-Morse Sequence , 1998, SETA.

[21]  Hui Rao,et al.  On substitution invariant Sturmian words: an application of Rauzy fractals , 2007, RAIRO Theor. Informatics Appl..