There are level ternary circular square-free words of length n for n\ne 5,7,9,10,14,17.
From MaRDI portal
Publication:6340601
arXiv2005.06235MaRDI QIDQ6340601FDOQ6340601
Authors: James D. Currie, Jesse T. Johnson 
Publication date: 13 May 2020
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
This page was built for publication: There are level ternary circular square-free words of length $n$ for $n\ne 5,7,9,10,14,17.$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340601)
