Square-Free Words with Square-Free Self-Shuffles James D. Currie Kalle Saari DOI: https://doi.org/10.37236/3605 Keywords: combinatorics on words, square-free words, self shuffles Abstract We answer a question of Harju: For every $n\ge 3$ there is a square-free ternary word of length $n$ with a square-free self-shuffle. PDF Published 2014-01-12 Issue Volume 21, Issue 1 (2014) Article Number P1.9
