On the number of return words in infinite words with complexity 2n+1

Simple item page
dc.creatorVuillon, Laurent
dc.date2000-09-08
dc.date.accessioned2026-07-07T04:37:18Z
dc.date.available2026-07-07T04:37:18Z
dc.descriptionIn this article, we count the number of return words in some infinite words with complexity 2n+1. We also consider some infinite words given by codings of rotation and interval exchange transformations on k intervals. We prove that the number of return words over a given word w for these infinite words is exactly k.
dc.descriptionsee also http://liafa.jussieu.fr/~vuillon/articles.html
dc.identifierhttps://arxiv.org/abs/math/0009094
dc.identifierhttp://arxiv.org/abs/math/0009094
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59903
dc.subjectCombinatorics
dc.subjectDynamical Systems
dc.subject68R15
dc.titleOn the number of return words in infinite words with complexity 2n+1
dc.typetext

Files

Collections

arXiv