Abelian complexity of infinite words associated with quadratic Parry numbers (Q653315): Difference between revisions

The abelian complexity of a word counts the number of different factors of same length, up to abelianization. For binary words, it is equal to one plus the difference of the maximal and the minimal number of occurrences of a letter in factors of same length. For fixed points of substitutions of the form \(A \mapsto A^p B\), \(B \mapsto A^q\), \(p \geq q \geq 1\), (related to simple quadratic Parry numbers) or \(A \mapsto A^p B\), \(B \mapsto A^q B\), \(p > q \geq 1\) (related to non-simple quadratic Parry numbers), the authors give explicit formulae. To this end, they find infinite words with all prefixes containing the maximal number of occurrences of \(A\) and \(B\), respectively. The formulae for simple Parry numbers are more complicated than those for non-simple Parry numbers.