Structure of $k$-interval exchange transformations: induction, trajectories, and distance theorems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal d'analyse mathématique Année : 2010

Structure of $k$-interval exchange transformations: induction, trajectories, and distance theorems

Résumé

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.

Dates et versions

hal-00865217 , version 1 (24-09-2013)

Identifiants

Citer

Sébastien Ferenczi, Luca Q. Zamboni. Structure of $k$-interval exchange transformations: induction, trajectories, and distance theorems. Journal d'analyse mathématique, 2010, 112, pp.289-329. ⟨10.1007/s11854-010-0031-2⟩. ⟨hal-00865217⟩
91 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More