Rauzy classes form a partition of the set of irreducible permutations. They were introduced as part of a renormalization algorithm for interval exchange transformations. We prove an explicit formula for the cardinality of each Rauzy class. Our proof uses a geometric interpretation of permutations and Rauzy classes in terms of translation surfaces and moduli spaces.

Let K(2ℕ) be the class of compact subsets of the Cantor space 2ℕ, furnished with the Hausdorff metric. Let f ∈ C(2ℕ). We study the map ω f: 2ℕ → K(2ℕ) defined as ω f (x) = ω(x, f), the ω-limit set of x under f. Unlike the case of n-dimensional manifolds, n ≥ 1, we show that ω f is continuous for the generic self-map f of the Cantor space, even though the set of functions for which ω f is everywhere discontinuous on a subsystem is dense in C(2ℕ). The relationships between the continuity of ω f and...

Nous étudions une classe de suites symboliques, les codages de rotations, intervenant dans des problèmes de répartition des suites ${\left(n\alpha \right)}_{n\in \mathbb{N}}$ et représentant une généralisation géométrique des suites sturmiennes. Nous montrons que ces suites peuvent être obtenues par itération de quatre substitutions définies sur un alphabet à trois lettres, puis en appliquant un morphisme de projection. L’ordre d’itération de ces applications est gouverné par un développement bi-dimensionnel de type “fraction continue”...

Let $\varphi$ be a substitution of Pisot type on the alphabet $𝒜=\{1,2,...,d\}$; $\varphi$ satisfies thestrong coincidence conditionif for every $i,j\in 𝒜$, there are integers $k,n$ such that ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ have the same $k$-th letter, and the prefixes of length $k-1$ of ${\varphi }^n\left(i\right)$ and ${\varphi }^n\left(j\right)$ 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\ge 2$.

We study the complexity of the infinite word $u_{\beta }$ associated with the Rényi expansion of $1$ in an irrational base $\beta \>1$. When $\beta$ is the golden ratio, this is the well known Fibonacci word, which is sturmian, and of complexity $ℂ\left(n\right)=n+1$. For $\beta$ such that $d_{\beta }\left(1\right)=t_1{t}_2\cdots t_m$ is finite we provide a simple description of the structure of special factors of the word $u_{\beta }$. When $t_m=1$ we show that $ℂ\left(n\right)=(m-1)n+1$. In the cases when $t_1=t_2=\cdots =t_{m-1}$ or $t_1\>max\{t_2,\cdots ,t_{m-1}\}$ we show that the first difference of the complexity function $ℂ(n+1)-ℂ\left(n\right)$ takes value in $\{m-1,m\}$ for every $n$, and consequently we determine...

We study the complexity of the infinite word uβ associated with the Rényi expansion of 1 in an irrational base β > 1. When β is the golden ratio, this is the well known Fibonacci word, which is Sturmian, and of complexity C(n) = n + 1. For β such that dβ(1) = t1t2...tm is finite we provide a simple description of the structure of special factors of the word uβ. When tm=1 we show that C(n) = (m - 1)n + 1. In the cases when t1 = t2 = ... tm-1or t1 > max{t2,...,tm-1} we show that the first difference of...

Rauzy fractals are compact sets with fractal boundary that can be associated with any unimodular Pisot irreducible substitution. These fractals can be defined as the Hausdorff limit of a sequence of compact sets, where each set is a renormalized projection of a finite union of faces of unit cubes. We exploit this combinatorial definition to prove the connectedness of the Rauzy fractal associated with any finite product of three-letter Arnoux–Rauzy substitutions.

Étant donné un automorphisme $\sigma$ d’un groupe libre et un représentant topologique train-track de son inverse, on peut construire un arbre réel $T$ appelé arbre répulsif de $\sigma$. Le groupe libre agit sur $T$ par isométries. La dynamique engendrée par $\sigma$ peut être représentée par l’action du groupe libre restreinte à un sous-ensemble compact bien choisi du complété métrique de $T$. Cet article construit ce sous-ensemble sur une classe d’exemples en introduisant des opérations appelées substitutions d’arbre ;...

This paper is a study of the global structure of the attractors of a dynamical system. The dynamical system is associated with an oriented graph called a Symbolic Image of the system. The symbolic image can be considered as a finite discrete approximation of the dynamical system flow. Investigation of the symbolic image provides an opportunity to localize the attractors of the system and to estimate their domains of attraction. A special sequence of symbolic images is considered in order to obtain...

We add a sufficient condition for validity of Propo- sition 4.10 in the paper Frougny et al. (2004). This condition is not a necessary one, it is nevertheless convenient, since anyway most of the statements in the paper Frougny et al. (2004) use it.

We add a sufficient condition for validity of Propo- sition 4.10 in the paper Frougny et al. (2004). This condition is not a necessary one, it is nevertheless convenient, since anyway most of the statements in the paper Frougny et al. (2004) use it.