Descendants of Primitive Substitutions

Holton, Charles; Zamboni, Luca Q.

doi:10.1007/s002240000114

Cited by 38 publications

(40 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the coding is a primitive substitutive system, Theorem 7.2 of [17] implies that the number of induced systems on the union of cylinders is finite (up to a letter-to-letter bijection). As the algorithm defined in Section 2.6 or 3.1 is an induction on the union of cylinders, this means that it is ultimately periodic, which means the induction path is ultimately periodic.…”

Section: Substitutions Definition 34mentioning

confidence: 99%

Structure of K-interval exchange transformations: Induction, trajectories, and distance theorems

Ferenczi

Zamboni

2010

JAMA

View full text Add to dashboard Cite

Abstract. We define a new induction algorithm for k-interval exchange transformations associated to the "symmetric" permutation i → k − i + 1. Acting as a multi-dimensional continued fraction algorithm, it defines a sequence of generalized partial quotients given by an infinite path in a graph whose vertices, or states, are certain trees we call trees of relations. This induction is self-dual for the duality between the usual Rauzy induction and the da Rocha induction. We use it to describe those words obtained by coding orbits of points under a symmetric interval exchange, in terms of the generalized partial quotients associated with the vector of lengths of the k intervals. As a consequence, we improve a bound of Boshernitzan in a generalization of the three-distances theorem for rotations. However, a variant of our algorithm, applied to a class of interval exchange transformations with a different permutation, shows that the former bound is optimal outside the hyperelliptic class of permutations. PreliminariesInterval exchange transformations were originally introduced by Oseledec [27], following an idea of Arnold [2]; see also Katok and Stepin [20]. An exchange of k intervals, denoted throughout this paper by I, is given by a probability vector of k lengths (α 1 , . . . , α k ) together with a permutation π on k letters. The unit interval is partitioned into k subintervals of lengths α 1 , . . . , α k which are rearranged by I according to π. It was Rauzy [29] who first saw interval exchange transformations as a possible framework for generalizing the well-known interaction between circle rotations on one hand and Sturmian sequences on the other via the continued fraction algorithm (see, for example, the survey [7] [4]. But, in contrast with the Sturmian case, though this induction gives access to the symbolic dynamics of the trajectories, it is difficult to describe them explicitly and indeed the Rauzy induction was never actually used for that purpose. A partial description of the trajectories was given in [24], and it aroused interest by defining a different kind of induction; this da Rocha induction was then considered to be dual to the Rauzy induction: the Rauzy induction builds the points where the orbits of the discontinuities of I approximate 0, while the da Rocha induction builds the points where the orbit of 0 approximates the discontinuities of I −1 . Note that (non-constructive) combinatorial characterizations of the language of trajectories were given recently in [16] and [5].These inductions are also a fundamental tool in the study of the space of moduli of Riemann surfaces, and the various strata of its unit tangent bundle, through what has been a basic object of interest for the last 25 years, the Teichmüller flow on a stratum; in the case of interval exchanges, we consider the Teichmüller flow for the Riemann surface obtained by glueing parallel opposite sides of a polygon. The Rauzy induction chooses an initial segment of a horizontal separatrix and follows its vertical separatrix till it i...

show abstract

Section: Substitutions Definition 34mentioning

confidence: 99%

Structure of K-interval exchange transformations: Induction, trajectories, and distance theorems

Ferenczi

Zamboni

2010

JAMA

View full text Add to dashboard Cite

show abstract

“…We will also call a derived sequence the sequence over A h obtained by coding the sequence pυ. We will use the following result [20,25,22]: Theorem 2.10. A uniformly recurrent sequence is primitive substitutive if and only if the set of derived sequences (up to the alphabet) over all its factors is finite.…”

Section: A Multiplicative S-adic Expansionmentioning

confidence: 99%

Initial powers of Sturmian sequences

2006

View full text Add to dashboard Cite

“…This concept of derived sequence (or descendant) was introduced independently by Durand and Holton and Zamboni [49]. A morphism f : A * → A * is primitive if the matrix M = (|f (a)| b ) a,b∈A ∈ N A×A is primitive, i.e., there exists n such that M n > 0.…”

Section: General Frameworkmentioning

confidence: 99%

Relations on words

Rigo

2017

Indagationes Mathematicae

View full text Add to dashboard Cite

In the first part of this survey, we present classical notions arising in combinatorics on words: growth function of a language, complexity function of an infinite word, pattern avoidance, periodicity and uniform recurrence. Our presentation tries to set up a unified framework with respect to a given binary relation.In the second part, we mainly focus on abelian equivalence, k-abelian equivalence, combinatorial coefficients and associated relations, Parikh matrices and M -equivalence. In particular, some new refinements of abelian equivalence are introduced.

show abstract

Descendants of Primitive Substitutions

Cited by 38 publications

References 10 publications

Structure of K-interval exchange transformations: Induction, trajectories, and distance theorems

Structure of K-interval exchange transformations: Induction, trajectories, and distance theorems

Initial powers of Sturmian sequences

Relations on words

Contact Info

Product

Resources

About