7 citations · 16 across the 13 of their papers we have counts for
14 papers
Typical Weak Mixing and Exceptional Spectral Properties for Interval Translation Mappings
Mauro Artigiani, Artur Avila, Sébastien Ferenczi +2
We investigate weak mixing for some classes of interval translation mappings. We give two distinct proofs that a typical Bruin-Troubetzkoy interval translation mapping is weakly mi…
Clustering, order conditions, and languages of interval exchanges
Sébastien Ferenczi, Luca Q. Zamboni
We investigate various connections between the clustering for the Burrows-Wheeler transform, a lossless algorithm used in data compression, and languages of interval exchange trans…
Clustering and Arnoux-Rauzy words
Sébastien Ferenczi, Luca Q. Zamboni
We characterize the clustering of a word under the Burrows-Wheeler transform in terms of the resolution of a bounded number of bispecial factors belonging to the language generated…
Languages of general interval exchange transformations
Sébastien Ferenczi, Pascal Hubert, Luca Q. Zamboni
The languages generated by interval exchange transformations have been characterized by Ferenczi-Zamboni (2008) and Belov-Cernyatev (2010) under some extra conditions on the system…
Minimality and unique ergodicity of Veech 1969 type interval exchange transformations
Sébastien Ferenczi, Pascal Hubert
We give conditions for minimality of extensions of a rotation of angle with one marked point, solving the problem for any prime : for , these cor…
Rigidity of generalized Veech 1969/Sataev 1975 extensions of rotations
Sébastien Ferenczi, Pasacal Hubert
We look at -point extensions of a rotation of angle with marked points, generalizing the examples of Veech 1969 and Sataev 1975, together with the square-tiled interval…
Arnoux-Rauzy interval exchange transformations
Pierre Arnoux, Julien Cassaigne, Sébastien Ferenczi +1
The Arnoux-Rauzy systems are defined in \cite{ar}, both as symbolic systems on three letters and exchanges of six intervals on the circle. In connection with a conjecture of S.P. N…
An algorithm for the word entropy
Carlos Gustavo Moreira, Christian Mauduit, Sébastien Ferenczi
For any infinite word on a finite alphabet , the complexity function of is the sequence counting, for each non-negative , the number of words of length…
Sarnak's Conjecture -- what's new
S. Ferenczi, J. Kułaga-Przymus, M. Lemańczyk
An overview of last seven years results concerning Sarnak's conjecture on Möbius disjointness is presented, focusing on ergodic theory aspects of the conjecture.
Rigidity of square-tiled interval exchange transformations
Sébastien Ferenczi, Pascal Hubert
We look at interval exchange transformations defined as first return maps on the set of diagonals of a flow of direction on a square-tiled surface: using a combinatorial approa…
Constructive symbolic presentations of rank one measure-preserving systems
Terrence Adams, Sébastien Ferenczi, Karl Petersen
Given a rank one measure-preserving system defined by cutting and stacking with spacers, we produce a rank one binary sequence such that its orbit closure under the shift transform…
Substitutions and Möbius disjointness
S. Ferenczi, J. Kułaga-Przymus, M. Lemańczyk +1
We show that Sarnak's conjecture on Möbius disjointness holds for all subshifts given by bijective substitutions and some other similar dynamical systems, e.g.\ those generated by…
Clustering words
Sébastien Ferenczi, Luca Q. Zamboni
We characterize words which cluster under the Burrows-Wheeler transform as those words such that occurs in a trajectory of an interval exchange transformation, and build e…
Dynamical generalizations of the Lagrange spectrum
Sébastien Ferenczi
We compute two invariants of topological conjugacy, the upper and lower limits of the inverse of Boshernitzan's ne_n, where e_n is the smallest measure of a cylinder of length n, f…