Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words

Laboratory of Physics, Kochi University of Technology, Tosa Yamada, Kochi 782-8502, Japan; ondrej.turek@kochi-tech.ac.jp

Received: 7 March 2010
Accepted: 16 June 2010

Abstract

A word u defined over an alphabet is c-balanced (c ∈ ) if for all pairs of factors v, w of u of the same length and for all letters a ∈ , the difference between the number of letters a in v and w is less or equal to c. In this paper we consider a ternary alphabet = {L, S, M} and a class of substitutions defined by (L) = L^pS, (S) = M, (M) = L^p–1S where p > 1. We prove that the fixed point of , formally written as (L), is 3-balanced and that its Abelian complexity is bounded above by the value 7, regardless of the value of p. We also show that both these bounds are optimal, i.e. they cannot be improved.