58 research outputs found

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

    Get PDF
    A word uu defined over an alphabet A\mathcal{A} is cc-balanced (c∈Nc\in\mathbb{N}) if for all pairs of factors vv, ww of uu of the same length and for all letters a∈Aa\in\mathcal{A}, the difference between the number of letters aa in vv and ww is less or equal to cc. In this paper we consider a ternary alphabet A={L,S,M}\mathcal{A}=\{L,S,M\} and a class of substitutions ϕp\phi_p defined by ϕp(L)=LpS\phi_p(L)=L^pS, ϕp(S)=M\phi_p(S)=M, ϕp(M)=Lp−1S\phi_p(M)=L^{p-1}S where p>1p>1. We prove that the fixed point of ϕp\phi_p, formally written as ϕp∞(L)\phi_p^\infty(L), is 3-balanced and that its Abelian complexity is bounded above by the value 7, regardless of the value of pp. 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

    Get PDF
    G. Rauzy showed that the Tribonacci minimal subshift generated by the morphism τ:0↦01,1↦02and2↦0\tau: 0\mapsto 01, 1\mapsto 02 and 2\mapsto 0 is measure-theoretically conjugate to an exchange of three fractal domains on a compact set in R2R^2, 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 tt which is the unique fixed point of τ\tau. We show that AC(n)∈3,4,5,6,7AC(n)\in {3,4,5,6,7} for each n≥1n\geq 1, 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 UU and VV of tt of equal length, and for every letter a∈0,1,2a \in {0,1,2}, the number of occurrences of aa in UU and the number of occurrences of aa in VV 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 tt. The first uses the word combinatorial properties of the generating morphism, while the second exploits the spectral properties of the incidence matrix of τ\tau.Comment: 20 pages, 1 figure. This is an extended version of 0904.2872v
    • …
    corecore