Cyclically repetition-free words on small alphabets

详细信息    查看全文

• 作者：Tero Harju ; Dirk Nowotka
• 关键词：Combinatorial problems ; Combinatorics on words ; Repetitions ; Conjugates ; Square-free words
• 刊名：Information Processing Letters
• 出版年：2010
• 出版时间：1 July 2010
• 年：2010
• 卷：110
• 期：14-15
• 页码：591-595
• 全文大小：150 K

文摘

All sufficiently long binary words contain a square but there are infinite binary words having only the short squares 00, 11 and 0101. Recently it was shown by J. Currie that there exist cyclically square-free words in a ternary alphabet except for lengths 5, 7, 9, 10, 14, and 17. We consider binary words all conjugates of which contain only short squares. We show that the number c(n) of these binary words of length n grows unboundedly. In order for this, we show that there are morphisms that preserve circular square-free words in the ternary alphabet.