Cardinality of Rauzy classes
Combinatorics
2015-12-03 v1 Dynamical Systems
Abstract
Rauzy classes define a partition of the set of irreducible (or indecomposable) permutations. They were defined by G. Rauzy as part of an induction algorithm for interval exchange transformations. In this article we prove an explicit formula for the cardinality of all Rauzy classes.
Cite
@article{arxiv.1106.0807,
title = {Cardinality of Rauzy classes},
author = {Vincent Delecroix},
journal= {arXiv preprint arXiv:1106.0807},
year = {2015}
}
Comments
43 pages, 22 figures