Infinite square-free self-shuffling words
Preprint
Abstract
In this paper we answer two recent questions from Charlier et al. and Harju about self-shuffling words. An infinite word $w$ is called self-shuffling, if $w=\prod_{i=0}^\infty U_iV_i=\prod_{i=0}^\infty U_i=\prod_{i=0}^\infty V_i$ for some finite words $U_i$, $V_i$. Harju recently asked whether square-free self-shuffling words exist. We answer this question affirmatively. Besides that, we build an infinite word such that no word in its shift orbit closure is self-shuffling, answering positively a question from Charlier et al.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Square-free shuffles of wordsTheoretical Computer Science, 2015
- Infinite self-shuffling wordsJournal of Combinatorial Theory, Series A, 2014
- Square-Free Words with Square-Free Self-ShufflesThe Electronic Journal of Combinatorics, 2014
- A Note on Square-Free Shuffles of Words2013
- Last cases of Dejean’s conjectureTheoretical Computer Science, 2011
- A proof of Dejean’s conjectureMathematics of Computation, 2010
- Algebraic Combinatorics on Words2002
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988