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

TL;DR
This paper investigates the occurrence of factors in infinite words that are images under non-trivial morphisms, establishing minimal lengths and counts of such factors in binary and general infinite words.
Contribution
It proves the minimal length of imaged factors in infinite words and the minimal number of such factors in binary words, providing optimal bounds.
Findings
Every infinite word contains an imaged factor of length at least 6.
Every infinite binary word contains at least 36 distinct imaged factors.
The bounds of 6 and 36 are proven to be optimal.
Abstract
We say that a finite factor of a word is \emph{imaged} if there exists a non-erasing morphism , distinct from the identity, such that contains . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
