Words and morphisms with Sturmian erasures

Simple item page
dc.creatorDurand, Fabien
dc.creatorGuerziz, Adel
dc.creatorKoskas, Michel
dc.date2008-01-03
dc.date.accessioned2026-07-07T08:52:22Z
dc.date.available2026-07-07T08:52:22Z
dc.descriptionWe say $x \in \{0,1,2 \}^{\NN}$ is a word with Sturmian erasures if for any $a\in \{0,1,2 \}$ the word obtained erasing all $a$ in $x$ is a Sturmian word. A large family of such words is given coding trajectories of balls in the game of billiards in the cube. We prove that the monoid of morphisms mapping all words with Sturmian erasures to words with Sturmian erasures is not finitely generated.
dc.identifierhttps://arxiv.org/abs/0801.0558
dc.identifierhttp://arxiv.org/abs/0801.0558
dc.identifierBulletin of the Belgian Mathematical Society 11, 4 (2004) 575-588
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145260
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subject68R15
dc.titleWords and morphisms with Sturmian erasures
dc.typetext

Files

Collections

arXiv