Infinite ternary square-free words concatenated from permutations of a single word

2012/07/14 by James D. Currie, Currie, James D.
Computer Science · Mathematics · #68R15 #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #cs.FL #math.CO #msc:68R15

paper · pdf · doi:10.48550/arxiv.1207.3445

arxiv created 2012/07/20 · arxiv updated 2012/07/23

Abstract

We answer a question of Harju: An infinite square-free ternary word with an n-stem factorization exists for any n≥ 13. We show that there are uniform ternary morphisms of length k for every k≥ 23. This resolves almost completely a problem of the author and Rampersad.

Related

• Improved bounds on the number of ternary square-free words
• A ternary square-free sequence avoiding factors equivalent to abcacba
• Lengths of extremal square-free ternary words
• Square-Free Shuffles of Words
• Square-free reducts of words