On a class of infinite words with affine factor complexity

Simple item page
dc.creatorBernat, J.
dc.creatorMasáková, Z.
dc.creatorPelantová, E.
dc.date2006-12-16
dc.date2007-01-12
dc.date.accessioned2026-07-07T07:40:00Z
dc.date.available2026-07-07T07:40:00Z
dc.descriptionIn this article, we consider the factor complexity of a fixed point of a primitive substitution canonically defined by a beta-numeration system. We provide a necessary and sufficient condition on the Renyi expansion of 1 for having an affine factor complexity map C(n), that is, such that C(n)=an+b for any integer n.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/0612466
dc.identifierhttp://arxiv.org/abs/math/0612466
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121659
dc.subjectCombinatorics
dc.subject11A63, 11A67, 37B10, 68R15
dc.titleOn a class of infinite words with affine factor complexity
dc.typetext

Files

Collections

arXiv