SearcharxivSearch

arXiv · 2009.09958

Embedding theorems for solvable groups

Abstract

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in {\mathcal M}{\mathcal A}$ (${\mathcal A}$ means the variety of abelian groups). If $G$ is a finite group, then $H$ can also be found as a finite group. It follows, that any finitely generated (finite) solvable group $G$ of the derived length $l$ can be embedded in a $4$-generated (finite) solvable group $H$ of length $l+1$. Thus, we answer the question of V. H. Mikaelian and A.Yu. Olshanskii. It is also shown that any countable group $G\in {\mathcal M}$, such that the abelianization $G_{ab}$ is a free abelian group, is embeddable in a $2$-generated group $H\in {\mathcal M}{\mathcal A}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Vitaly Roman'kov. 2020-09-21. Embedding theorems for solvable groups. https://arxiv.org/abs/2009.09958

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