Determining solubility for finitely generated groups of PL homeomorphisms

DOI10.1090/TRAN/8421MaRDI QIDQ6263910arXivFDO

Authors Collin Bleak, Tara Brough, Susan Hermiller

Publication date 24 July 2015

Published in arXiv

Full work available at URL https://doi.org/10.1090/TRAN/8421

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Fixed points and periodic points of dynamical systems; fixed-point index theory; local dynamics (37C25)

arXiv classification

math.GR

Abstract: The set of finitely generated subgroups of the group $P{L}_{+}(I)$ of orientation-preserving piecewise-linear homeomorphisms of the unit interval includes many important groups, most notably R.~Thompson's group $F$. In this paper we show that every finitely generated subgroup $G<P{L}_{+}(I)$ is either soluble, or contains an embedded copy of Brin's group $B$, a finitely generated, non-soluble group, which verifies a conjecture of the first author from 2009. In the case that $G$ is soluble, we show that the derived length of $G$ is bounded above by the number of breakpoints of any finite set of generators. We specify a set of `computable' subgroups of $P{L}_{+}(I)$ (which includes R. Thompson's group $F$) and we give an algorithm which determines in finite time whether or not any given finite subset $X$ of such a computable group generates a soluble group. When the group is soluble, the algorithm also determines the derived length of $langleXangle$. Finally, we give a solution of the membership problem for a family of finitely generated soluble subgroups of any computable subgroup of $P{L}_{+}(I)$.

This page was built for publication: Determining solubility for finitely generated groups of PL homeomorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6263910)