Infinite self-shuffling words. / Charlier, Émilie; Kamae, Teturo; Puzynina, Svetlana; Zamboni, Luca Q.
In: Journal of Combinatorial Theory. Series A, Vol. 128, No. 1, 01.01.2014, p. 1-40.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Infinite self-shuffling words
AU - Charlier, Émilie
AU - Kamae, Teturo
AU - Puzynina, Svetlana
AU - Zamboni, Luca Q.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - In this paper we introduce and study a new property of infinite words: An infinite word x∈AN, with values in a finite set A, is said to be k- self-shuffling (k ≥ 2) if x admits factorizations: x=∏i=0∞Ui(1)⋯Ui(k)=∏i=0∞Ui(1)=⋯=∏i=0∞Ui(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 α∈RQ 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.
AB - In this paper we introduce and study a new property of infinite words: An infinite word x∈AN, with values in a finite set A, is said to be k- self-shuffling (k ≥ 2) if x admits factorizations: x=∏i=0∞Ui(1)⋯Ui(k)=∏i=0∞Ui(1)=⋯=∏i=0∞Ui(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 α∈RQ 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.
KW - Lyndon words
KW - Morphic words
KW - Sturmian words
KW - Thue-Morse word
KW - Word shuffling
UR - http://www.scopus.com/inward/record.url?scp=84905675832&partnerID=8YFLogxK
U2 - 10.1016/j.jcta.2014.07.008
DO - 10.1016/j.jcta.2014.07.008
M3 - Article
AN - SCOPUS:84905675832
VL - 128
SP - 1
EP - 40
JO - Journal of Combinatorial Theory - Series A
JF - Journal of Combinatorial Theory - Series A
SN - 0097-3165
IS - 1
ER -
ID: 35285465