2000 character limit reached
Infinite square-free self-shuffling words
Published 25 Jan 2014 in cs.DM, cs.FL, and math.CO | (1401.6536v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.