arXiv Analytics

Sign in

arXiv:math/0612466 [math.CO]AbstractReferencesReviewsResources

On a class of infinite words with affine factor complexity

J. Bernat, Z. Masáková, E. Pelantová

Published 2006-12-16, updated 2007-01-12Version 2

In 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.

Comments: 14 pages
Categories: math.CO
Subjects: 11A63, 11A67, 37B10, 68R15
Related articles: Most relevant | Search more
arXiv:math/0611508 [math.CO] (Published 2006-11-16)
Palindromic complexity of infinite words associated with non-simple Parry numbers
arXiv:math/0009094 [math.CO] (Published 2000-09-08)
On the number of return words in infinite words with complexity 2n+1
arXiv:1901.06351 [math.CO] (Published 2019-01-18)
Some further results on squarefree arithmetic progressions in infinite words

Links

Toolbox