Self-Inverses, Lagrangian Permutations and Minimal Interval Exchange Transformations with Many Ergodic Measures
Abstract
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 permutation. In this paper, we shall prove the existence of self-inverse permutations in every Rauzy Class by giving an explicit construction of such an element satisfying the sufficient conditions. We will also show that self-inverse permutations are Lagrangian, meaning any suspension has its vertical cycles span a Lagrangian subspace in homology. This will simplify the proof of a lemma in a work by G. Forni. W. A. Veech proved a bound on the number of distinct ergodic probability measures for a given minimal interval exchange transformation. We verify that this bound is sharp by construcing examples in each Rauzy Class.
Cite
@article{arxiv.1202.4035,
title = {Self-Inverses, Lagrangian Permutations and Minimal Interval Exchange Transformations with Many Ergodic Measures},
author = {Jon Fickenscher},
journal= {arXiv preprint arXiv:1202.4035},
year = {2013}
}
Comments
This paper strictly contains the information in "Self-Inverses in Rauzy Classes" that concerns 'true' permutations. Other than revisions and general improvements, the following portions are entirely new: Sections 1.4-1.5 and Section 4. arXiv admin note: substantial text overlap with arXiv:1103.3485