Related papers: Arnoux-Rauzy interval exchange transformations

A Sturmian sequence is an infinite nonperiodic string over two letters with minimal subword complexity. In two papers, the first written by Morse and Hedlund in 1940 and the second by Coven and Hedlund in 1973, a surprising correspondence…

Any infinite sequence of substitutions with the same matrix of the Pisot type defines a symbolic dynamical system which is minimal. We prove that, to any such sequence, we can associate a compact set (Rauzy fractal) by projection of the…

Thanks to works by M. Kontsevich and A. Zorich followed by C. Boissy, we have a classification of all Rauzy Classes of any given genus. It follows from these works that Rauzy Classes are closed under the operation of inverting the…

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

Transfer entropy is a measure of the magnitude and the direction of information flow between jointly distributed stochastic processes. In recent years, its permutation analogues are considered in the literature to estimate the transfer…

We exhibit an explicit full measure class of minimal interval exchange maps T for which the cohomological equation $\Psi -\Psi\circ T=\Phi$ has a bounded solution $\Psi$ provided that the datum $\Phi$ belongs to a finite codimension…

For irreducible interval exchange transformations, we study the relation between the powers of induced map and the induced maps of powers and raise a condition of equivalence between them. And skew production of Rauzy induction map is set…

We show that there exists an interval exchange and a point so that the orbit of the point equidistributes for a measure that is not ergodic.

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…

We consider generalized interval exchange transformations, or briefly GIETs, that is bijections of the interval which are piecewise increasing homeomorphisms with finite branches. When all continuous branches are translations, such maps are…

To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential complexity the Rauzy graphs converge to the line $\mathbf{Z}$ in…

In this paper, based on a construction by J. Fickenscher, we construct a family of non-uniquely ergodic interval exchange transformations on $n$ intervals with the maximal possible number of measures, $\left\lfloor \frac{n}{2}…

Permutation entropy quantifies the diversity of possible orderings of the values a random or deterministic system can take, as Shannon entropy quantifies the diversity of values. We show that the metric and permutation entropy…

Physical systems may couple to other systems through variables that are not gauge invariant. When we split a gauge system into two subsystems, the gauge-invariant variables of the two subsystems have less information than the gauge…

In [Mas82] and [Vee78] it was proved independently that almost every interval exchange transformation is uniquely ergodic. The Birkhoff ergodic theorem implies that these maps mainly have uniformly distributed orbits. This raises the…

We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…

The paper is concerned with asymptotic stability properties of linear switched systems. Under the hypothesis that all the subsystems share a non strict quadratic Lyapunov function, we provide a large class of switching signals for which a…

We study balancedness properties of words given by the Arnoux-Rauzy and Brun multi-dimensional continued fraction algorithms. We show that almost all Brun words on 3 letters and Arnoux-Rauzy words over arbitrary alphabets are finitely…

The Arnoux-Rauzy-Poincar\'e multidimensional continued fraction algorithm is obtained by combining the Arnoux-Rauzy and Poincar\'e algorithms. It is a generalized Euclidean algorithm. Its three-dimensional linear version consists in…

A new approach to analysis of the synchronization of chaotic oscillations in two (or more) coupled oscillators is described that makes it possible to reveal changes in the structure of attractors and detect the appearance of intermittency.…