58 research outputs found
Balances and Abelian Complexity of a Certain Class of Infinite Ternary Words
A word defined over an alphabet is -balanced
() if for all pairs of factors , of of the same
length and for all letters , the difference between the number
of letters in and is less or equal to . In this paper we
consider a ternary alphabet and a class of
substitutions defined by , ,
where . We prove that the fixed point of ,
formally written as , is 3-balanced and that its Abelian
complexity is bounded above by the value 7, regardless of the value of . We
also show that both these bounds are optimal, i.e. they cannot be improved.Comment: 26 page
Balance and Abelian complexity of the Tribonacci word
G. Rauzy showed that the Tribonacci minimal subshift generated by the
morphism is
measure-theoretically conjugate to an exchange of three fractal domains on a
compact set in , each domain being translated by the same vector modulo a
lattice. In this paper we study the Abelian complexity AC(n) of the Tribonacci
word which is the unique fixed point of . We show that for each , and that each of these five values is assumed.
Our proof relies on the fact that the Tribonacci word is 2-balanced, i.e., for
all factors and of of equal length, and for every letter , the number of occurrences of in and the number of occurrences
of in differ by at most 2. While this result is announced in several
papers, to the best of our knowledge no proof of this fact has ever been
published. We offer two very different proofs of the 2-balance property of .
The first uses the word combinatorial properties of the generating morphism,
while the second exploits the spectral properties of the incidence matrix of
.Comment: 20 pages, 1 figure. This is an extended version of 0904.2872v
- …