Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2025

Words avoiding the morphic images of most of their factors

Résumé

We say that a finite factor $f$ of a word $w$ is \emph{imaged} if there exists a non-erasing morphism $m$, distinct from the identity, such that $w$ contains $m(f)$. We show that every infinite word contains an imaged factor of length at least 6 and that 6 is best possible. We show that every infinite binary word contains at least 36 distinct imaged factors and that 36 is best possible.

Mots clés

Dates et versions

lirmm-05326624 , version 1 (22-10-2025)

Identifiants

Citer

Pascal Ochem, Matthieu Rosenfeld. Words avoiding the morphic images of most of their factors. Discrete Mathematics and Theoretical Computer Science, 2025, 27:3 (Combinatorics), ⟨10.46298/dmtcs.15919⟩. ⟨lirmm-05326624⟩
60 Consultations
0 Téléchargements

Altmetric

Partager

  • More