SearcharxivSearch

arXiv · math/0510399

Solvability in Groups of Piecewise-linear Homeomorphisms of the Unit Interval

Abstract

We investigate subgroups of the group PLo(I) of piecewise-linear, orientation preserving homeomorphisms of the unit interval with finitely many breaks in slope, and also subgroups of Thompson's group F. We find geometric criteria determining the derived length of any such group, and use this criteria to classify the solvable and non-solvable subgroups of PLo(I) and of F. Let H be a subgroup of PL_o(I) or F. We find that H is solvable if and only if H is isomorphic to a group in a well described class R of groups. We also find that H is non-solvable if and only if we can embed a copy of a specific non-solvable group W into H. We strengthen the non-solvability classification by finding weak geometric criteria under which we can embed other groups (all containing W) into non-solvable subgroups of PLo(I) or F.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Collin Bleak. 2005-10-18. Solvability in Groups of Piecewise-linear Homeomorphisms of the Unit Interval. https://arxiv.org/abs/math/0510399

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