Pascal Ochem ; Matthieu Rosenfeld - Words avoiding the morphic images of most of their factors

dmtcs:15919 - Discrete Mathematics & Theoretical Computer Science, September 23, 2025, vol. 27:3 - https://doi.org/10.46298/dmtcs.15919
Words avoiding the morphic images of most of their factorsArticle

Authors: Pascal Ochem ; Matthieu Rosenfeld

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.


Volume: vol. 27:3
Section: Combinatorics
Published on: September 23, 2025
Accepted on: September 17, 2025
Submitted on: June 23, 2025
Keywords: Combinatorics

Consultation statistics

This page has been seen 449 times.
This article's PDF has been downloaded 252 times.