Abstract: Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the graph. In addition, our proof implies an exponential lower bound on the number of such circular words of length and allows one to list all lengths for which such a circular word is unique up to isomorphism.
Recommendations
Cited in
(19)- On the existence of minimal \(\beta\)-powers
- On balanced and abelian properties of circular words over a ternary alphabet
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- Circularly squarefree words and unbordered conjugates: a new approach
- Counting ternary square-free words quickly
- A ternary square-free sequence avoiding factors equivalent to abcacba
- Distinct squares in circular words
- Lengths of extremal square-free ternary words
- Squarefree extensions of words
- Subword complexity and power avoidance
- Counting subwords in circular words and their Parikh matrices
- scientific article; zbMATH DE number 2000848 (Why is no real title available?)
- On periodic properties of circular words
- Cyclically repetition-free words on small alphabets
- On the tree of ternary square-free words
- Square-free partial words with many wildcards
- Avoiding letter patterns in ternary square-free words
- Ternary square-free partial words with many wildcards
This page was built for publication: On ternary square-free circular words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q612919)
