Abstract:Abstract. -Let ϕ be a substitution of Pisot type on the alphabet A = {1, 2, . . . , d}; ϕ satisfies the strong coincidence condition if for every i, j ∈ A, there are integers k, n such that ϕ n (i) and ϕ n (j) have the same k-th letter, and the prefixes of length k − 1 of ϕ n (i) and ϕ n (j) have the same image under the abelianization map. We prove that the strong coincidence condition is satisfied if d = 2 and provide a partial result for d ≥ 2.Résumé (Coïncidence pour les substitutions de type Pisot). -Soit… Show more
“…To ensure that the subtiles are disjoint in measure, we recall from [9] the following combinatorial condition on substitutions. This condition is satisfied by every unimodular irreducible Pisot substitution over a two-letter alphabet [10]. It is conjectured that every substitution of Pisot type satisfies the strong coincidence condition.…”
Section: Definition 42 -Let σ Be a Primitive Unit Pisot Substitutiomentioning
“…To ensure that the subtiles are disjoint in measure, we recall from [9] the following combinatorial condition on substitutions. This condition is satisfied by every unimodular irreducible Pisot substitution over a two-letter alphabet [10]. It is conjectured that every substitution of Pisot type satisfies the strong coincidence condition.…”
Section: Definition 42 -Let σ Be a Primitive Unit Pisot Substitutiomentioning
“…For references on conditions under which the Pisot conjecture is true, we refer to, among other references, [1,2,3,4,5,6,7,11,12,15,16,21,22,23].…”
Section: Substitutions and Rauzy Fractalsmentioning
confidence: 99%
“…Many classes of substitutions are shown to satisfy this condition. For example, Barge and Diamond proved in [4] that every irreducible Pisot substitution over 2 letters satisfies it. It is conjectured that this is true for alphabets of arbitrary size but a general proof is still outstanding.…”
In this article we introduce the balanced pair algorithm associated with 2 unimodular Pisot substitutions having the same incidence matrix. We are interested in beta-substitution related to the polynomial x 3 − ax 2 − bx − 1 for a ≥ b ≥ 1 . Applying the balanced pair algorithm to these substitutions, we obtain a general formula for the associated intersection substitution.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.