There are level ternary circular square-free words of length n for n≠ 5,7,9,10,14,17.

2020/05/13 by Currie, James D., Johnson, Jesse T.
#68R15 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2005.06235

Abstract

A word is level if each letter appears in it the same number of times, plus or minus 1. We give a complete characterization of the lengths for which level ternary circular square-free words exist. Key words: combinatorics on words, circular words, necklaces, square-free words, non-repetitive sequences

Related

• Characterization of the lengths of binary circular words containing no\n squares other than 00, 11, and 0101
• Lengths of extremal square-free ternary words
• Distinct Squares in Circular Words
• Improved bounds on the number of ternary square-free words
• There are More Than 2**(n/17) n-Letter Ternary Square-Free Words