Sequences with constant number of return words

Simple item page
dc.creatorBalkova, Lubomira
dc.creatorPelantova, Edita
dc.creatorSteiner, Wolfgang
dc.date2006-08-24
dc.date2007-09-27
dc.date.accessioned2026-07-07T08:32:27Z
dc.date.available2026-07-07T08:32:27Z
dc.descriptionAn infinite word has the property $R_m$ if every factor has exactly $m$ return words. Vuillon showed that $R_2$ characterizes Sturmian words. We prove that a word satisfies $R_m$ if its complexity function is $(m-1)n+1$ and if it contains no weak bispecial factor. These conditions are necessary for $m=3$, whereas for $m=4$ the complexity function need not be $3n+1$. New examples of words satisfying $R_m$ are given by words related to digital expansions in real bases.
dc.identifierhttps://arxiv.org/abs/math/0608603
dc.identifierhttp://arxiv.org/abs/math/0608603
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138797
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.titleSequences with constant number of return words
dc.typetext

Files

Collections

arXiv