Doubled patterns are 3-avoidable - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles The Electronic Journal of Combinatorics Year : 2016

Doubled patterns are 3-avoidable

Pascal Ochem


In combinatorics on words, a word w over an alphabet Σ is said to avoid a pattern p over an alphabet ∆ if there is no factor f of w such that f = h(p) where h : ∆ * → Σ * is a non-erasing morphism. A pattern p is said to be k-avoidable if there exists an infinite word over a k-letter alphabet that avoids p. A pattern is said to be doubled if no variable occurs only once. Doubled patterns with at most 3 variables and patterns with at least 6 variables are 3-avoidable. We show that doubled patterns with 4 and 5 variables are also 3-avoidable.


Fichier principal
Vignette du fichier
motif45.pdf (245.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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



Pascal Ochem. Doubled patterns are 3-avoidable. The Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.19. ⟨10.37236/5618⟩. ⟨lirmm-01375763⟩
91 View
115 Download



Gmail Facebook X LinkedIn More