SearcharxivSearch

arXiv · 2206.10267

On embedding theorems for $\mathfrak{X}$-subgroups

Abstract

Let $\mathfrak{X}$ be a class of finite groups closed under subgroups, homomorphic images, and extensions. We study the question which goes back to the lectures of H. Wielandt in 1963-64: For a given $\mathfrak{X}$-subgroup $K$ and maximal $\mathfrak{X}$-subgroup $H$, is it possible to see embeddability of $K$ in $H$ (up to conjugacy) by their projections onto the factors of a fixed subnormal series. On the one hand, we construct examples where $K$ has the same projections as some subgroup of $H$ but is not conjugate to any subgroup of $H$. On the other hand, we prove that if $K$ normalizes the projections of a subgroup $H$, then $K$ is conjugate to a subgroup of $H$ even in the more general case when $H$ is a submaximal $\mathfrak{X}$-subgroup.

Explore related subjects

Keep this discovery

BibTeXRIS

Wenbin Guo, Danila O. Revin, Andrey V. Vasil'ev. 2022-06-21. On embedding theorems for $\mathfrak{X}$-subgroups. https://doi.org/10.1007/s00013-023-01865-y

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