SearcharxivSearch

arXiv · 2304.13691

Rigidity, Generators and Homology of Interval Exchange Groups

Abstract

Let $\Gamma$ be a dense countable subgroup of $\mathbb{R}$. Then, consider $IE(\Gamma)$; the group of piecewise linear bijections of $[0,1]$ with finitely many angles, all in $\Gamma$. We introduce and systematically study a family of partial transformation groupoids coming from inverse semigroups, $\mathcal{G}_\Gamma$, that realise $IE(\Gamma)$ as a topological full group. This new perspective on the groupoid models $\mathcal{G}_\Gamma$ of $IE(\Gamma)$ allows us to better understand the underlying C*-algebras and to compute homology. We show that $H_*(\mathcal{G}_\Gamma)=H_{*+1}(\Gamma)$. We show $C^*_r(\mathcal{G}_\Gamma)$ is classifiable in the sense of the Elliott classification program of C$^*$-algebras. We then classify these groups via the Elliott invariant, showing $IE(\Gamma) \cong IE(\Gamma') \Leftrightarrow \Gamma=\Gamma'$ as subsets of $\mathbb{R}$. We relate the K-Theory of the reduced C$^*$ -algebras to groupoid homology via Matui's HK Conjecture. We relate the homology of $IE(\Gamma)$ to the homology of $\Gamma$ using the recent framework developed by Li. We investigate in greater detail three key cases, namely if $\Gamma \subset \mathbb{Q}$, if $\Gamma \cong \mathbb{Z}^n$, and if $\Gamma$ is a ring. For these three cases, we study homology in greater detail and find explicit generating sets.

Explore related subjects

Keep this discovery

BibTeXRIS

Owen Tanner. 2023-04-26. Rigidity, Generators and Homology of Interval Exchange Groups. https://arxiv.org/abs/2304.13691

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR