More on Square-free Words Obtained from Prefixes by Permutations

Abstract

An infinite square-free word w over the alphabet Σ₃ = {0, 1, 2} is said to have a k-stem σ if |σ| = k and w = σw₁w₂ $\dots$ where for each i, there exists a permutation π_i of Σ₃ which extended to a morphism gives w_i = π_i(σ). Harju proved that there exists an infinite k-stem word for k = 1, 2, 3, 9 and 13 ≤ k ≤ 19, but not for 4 ≤ k ≤ 8 and 10 ≤ k ≤ 12. He asked whether k-stem words exist for each k ≥ 20. We give a positive answer to this question. Currie has found another construction that answers Harju's question.