Square-free Words with Square-free Self-shuffles

James D. Currie, Kalle Saari

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.

Keywords


combinatorics on words; square-free words; self shuffles

Full Text: PDF