SearcharxivSearch

arXiv · 1708.01290

Locally Solvable Subgroups of PLo(I)

Abstract

We show that locally solvable subgroups of PLo(I) are countable. Then for each countable ordered set, we construct a locally solvable subgroup of Thompson's Group F. We develop machinery for understanding embeddings from solvable subgroups into solvable subgroups. Finally, we apply this machinery to show the ordered sets used in our construction are invariant under isomorphisms between the groups constructed. Therefore, we effectively distinguish the groups and provide uncountably many non-isomorphic locally solvable, hence elementary amenable, subgroups of Thompson's Group F.

Explore related subjects

Keep this discovery

BibTeXRIS

Amanda Taylor. 2017-08-03. Locally Solvable Subgroups of PLo(I). https://arxiv.org/abs/1708.01290

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