2000 character limit reached
Infinite ternary square-free words concatenated from permutations of a single word
Published 14 Jul 2012 in cs.FL and math.CO | (1207.3445v2)
Abstract: We answer a question of Harju: An infinite square-free ternary word with an $n$-stem factorization exists for any $n\ge 13$. We show that there are uniform ternary morphisms of length $k$ for every $k\ge 23$. This resolves almost completely a problem of the author and Rampersad.
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.