Words avoiding the morphic images of most of their factors.

Saved in:

Bibliographic Details
Title:	Words avoiding the morphic images of most of their factors.
Authors:	Ochem, Pascal¹, Rosenfeld, Matthieu¹
Source:	Discrete Mathematics & Theoretical Computer Science (DMTCS). 2025, Vol. 27 Issue 3, p1-7. 7p.
Subjects:	Factorization, Mathematic morphism
Abstract:	We say that a finite factor f of a word w is 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. [ABSTRACT FROM AUTHOR]
	Copyright of Discrete Mathematics & Theoretical Computer Science (DMTCS) is the property of Discrete Mathematics & Theoretical Computer Science DMTCS and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	We say that a finite factor f of a word w is 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. [ABSTRACT FROM AUTHOR]
ISSN:	13658050