We define a Diophantine condition for interval-exchange transformations. When the number of intervals is two, that is, for rotations on the circle, our condition coincides with the classical Khinchin condition. We prove for interval-exchange transformations the same dichotomy as in the Khinchin Theorem. We also develop several results relating the Rauzy-Veech algorithm with homogeneous approximations for interval-exchange transformations. © 2011 AIMSciences
In this Thesis we investigate interval translation maps (ITMs) with, on the circle, two intervals, a...
We introduce a definition of admissibility for subintervals in interval exchange transformations. Us...
We consider generalized interval exchange transformations, or briefly GIETs, that is bijections of t...
We define a Diophantine condition for interval-exchange transformations. When the number of interval...
We define a diophantine condition for interval exchange transformations (i.e.t.). When the number of...
AbstractWe propose a method for obtaining the symbolic orbits of interval exchange transformations o...
International audienceThe Arnoux-Rauzy systems are defined in [5], both as symbolic systems on three...
International audienceWe define a new induction algorithm for k-interval exchange transformations as...
International audienceThe two-dimensional homogeneous Euclidean algorithm is the central motivation ...
Abstract. This paper gives a complete characterization of those sequences of subword complexity (k −...
International audienceThe Arnoux-Rauzy systems are defined in [5], both as symbolic systems on three...
Rauzy Induction, raised by Rauzy and Veech, has been served as an important technique to study inter...
In this Thesis we investigate interval translation maps (ITMs) with, on the circle, two intervals, a...
The two-dimensional homogeneous Euclidean algorithm is the central motivation for the defi-nition of...
International audienceA sharp bound on the number of invariant components of an interval exchange tr...
In this Thesis we investigate interval translation maps (ITMs) with, on the circle, two intervals, a...
We introduce a definition of admissibility for subintervals in interval exchange transformations. Us...
We consider generalized interval exchange transformations, or briefly GIETs, that is bijections of t...
We define a Diophantine condition for interval-exchange transformations. When the number of interval...
We define a diophantine condition for interval exchange transformations (i.e.t.). When the number of...
AbstractWe propose a method for obtaining the symbolic orbits of interval exchange transformations o...
International audienceThe Arnoux-Rauzy systems are defined in [5], both as symbolic systems on three...
International audienceWe define a new induction algorithm for k-interval exchange transformations as...
International audienceThe two-dimensional homogeneous Euclidean algorithm is the central motivation ...
Abstract. This paper gives a complete characterization of those sequences of subword complexity (k −...
International audienceThe Arnoux-Rauzy systems are defined in [5], both as symbolic systems on three...
Rauzy Induction, raised by Rauzy and Veech, has been served as an important technique to study inter...
In this Thesis we investigate interval translation maps (ITMs) with, on the circle, two intervals, a...
The two-dimensional homogeneous Euclidean algorithm is the central motivation for the defi-nition of...
International audienceA sharp bound on the number of invariant components of an interval exchange tr...
In this Thesis we investigate interval translation maps (ITMs) with, on the circle, two intervals, a...
We introduce a definition of admissibility for subintervals in interval exchange transformations. Us...
We consider generalized interval exchange transformations, or briefly GIETs, that is bijections of t...