Balances and Abelian complexity of a certain class of infinite ternary words

Abstract: A word

u

defined over an alphabet

m a t h c a l A

is

c

-balanced (

c i n m a t h b b N

) if for all pairs of factors

v

,

w

of

u

of the same length and for all letters

a i n m a t h c a l 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

m a t h c a l A = L, S, M

and a class of substitutions

p h i_{p}

defined by

p h i_{p} (L) = L^{p} S

,

p h i_{p} (S) = M

,

p h i_{p} (M) = L^{p - 1} S

where

p > 1

. We prove that the fixed point of

p h i_{p}

, formally written as

p h i_{p}^{i} n f t y (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.

Recommendations

Cites work

Cited in

(15)

This page was built for publication: Balances and Abelian complexity of a certain class of infinite ternary words