On prefixal factorizations of words

From MaRDI portal
Publication:896064




Abstract: We consider the class calP1 of all infinite words xinAomega over a finite alphabet A admitting a prefixal factorization, i.e., a factorization x=U0U1U2cdots where each Ui is a non-empty prefix of x. With each xincalP1 one naturally associates a "derived" infinite word delta(x) which may or may not admit a prefixal factorization. We are interested in the class calPinfty of all words x of calP1 such that deltan(x)incalP1 for all ngeq1. Our primary motivation for studying the class calPinfty stems from its connection to a coloring problem on infinite words independently posed by T. Brown in cite{BTC} and by the second author in cite{LQZ}. More precisely, let be the class of all words xinAomega such that for every finite coloring varphi:A+ightarrowC there exist cinC and a factorization x=V0V1V2cdots with varphi(Vi)=c for each igeq0. In cite{DPZ} we conjectured that a word if and only if x is purely periodic. In this paper we show that so in other words, potential candidates to a counter-example to our conjecture are amongst the non-periodic elements of calPinfty. We establish several results on the class calPinfty. In particular, we show that a Sturmian word x belongs to calPinfty if and only if x is nonsingular, i.e., no proper suffix of x is a standard Sturmian word.









This page was built for publication: On prefixal factorizations of words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896064)