On a class of infinite words with affine factor complexity
classification
🧮 math.CO
keywords
complexityfactoraffinearticlebeta-numerationcanonicallyclasscondition
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.