Describing the Set of Words Generated by Interval Exchange Transformation

What is it about?

In the paper under review the authors give a combinatorial characterization of those infinite recurrent words which can be obtained as a coding of an interval exchange transformation. The characterization is given in terms of evolution of the so-called Rauzy graphs. Such a characterization was already well-known in the case of Sturmian words (which correspond to codings of two-interval exchange transformations). Reviewed by Boris Adamczewski

Featured Image