Balances of m-bonacci Words

Publication date 22 December 2014

Abstract: The

m

-bonacci word is a generalization of the Fibonacci word to the

m

-letter alphabet

m a t h c a l A = 0, ..., m - 1

. It is the unique fixed point of the Pisot--type substitution

v a r p h i_{m} : 0 o 01, 1 o 02, ..., (m - 2) o 0 (m - 1), a n d (m - 1) o 0

. A result of Adamczewski implies the existence of constants

c^{(m)}

such that the

m

-bonacci word is

c^{(m)}

-balanced, i.e., numbers of letter

a

occurring in two factors of the same length differ at most by

c^{(m)}

for any letter

a i n m a t h c a l A

. The constants

c^{(m)}

have been already determined for

m = 2

and

m = 3

. In this paper we study the bounds

c^{(m)}

for a general

m g e q 2

. We show that the

m

-bonacci word is

(l f l o o r k a p p a m f l o o r + 12)

-balanced, where

k a p p a a p p r o x 0.58

. For

m l e q 12

, we improve the constant

c^{(m)}

by a computer numerical calculation to the value

l c e i l f r a c m + 1 2 c e i l

.

Recommendations

Cited in

(9)

This page was built for publication: Balances of m-bonacci Words