More on square-free words obtained from prefixes by permutations - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Fundamenta Informaticae Year : 2014

More on square-free words obtained from prefixes by permutations

Pascal Ochem

Abstract

An infinite square-free word w over the alphabet Σ3 = {0, 1, 2} is said to have a k-stem σ if |σ| = k and w = σw1w2 · · · where for each i, there exists a permutation πi of Σ3 which extended to a morphism gives wi = π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.
Fichier principal
Vignette du fichier
ochem_stem_FI.pdf (78.03 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-01375793 , version 1 (03-10-2016)

Identifiers

Cite

Pascal Ochem. More on square-free words obtained from prefixes by permutations. Fundamenta Informaticae, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112. ⟨10.3233/FI-2014-1035⟩. ⟨lirmm-01375793⟩
84 View
194 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More