SearcharxivSearch

arXiv · 2009.08145

A generalisation of Schenkman's theorem

Abstract

Let $G$ be a finite group and let $\mathfrak{F}$ be a hereditary saturated formation. We denote by $\mathbf{Z}_{\mathfrak{F}}(G)$ the product of all normal subgroups $N$ of $G$ such that every chief factor $H/K$ of $G$ below $N$ is $\mathfrak{F}$-central in $G$, that is, \[ (H/K) \rtimes (G/\mathbf{C}_{G}(H/K)) \in \mathfrak{F}. \]A subgroup $A \leq G$ is said to be $\mathfrak{F}$-subnormal in the sense of Kegel, or $K$-$\mathfrak{F}$-subnormal in $G$, if there is a subgroup chain \[ A = A_0 \leq A_1 \leq \ldots \leq A_n = G \] such that either $A_{i-1} \trianglelefteq A_{i}$ or $A_i / (A_{i-1})_{A_i} \in \mathfrak{F}$ for all $i = 1, \ldots , n$. In this paper, we prove the following generalisation of Schenkman's Theorem on the centraliser of the nilpotent residual of a subnormal subgroup: Let $\mathfrak{F}$ be a hereditary saturated formation and let $S$ be a $K$-$\mathfrak{F}$-subnormal subgroup of $G$. If $\mathbf{Z}_{\mathfrak{F}}(E) = 1$ for every subgroup $E$ of $G$ such that $S \leq E$ then $\mathbf{C}_{G}(D) \leq D$, where $D = S^{\mathfrak{F}}$ is the $\mathfrak{F}$-residual of $S$.

Explore related subjects

Keep this discovery

BibTeXRIS

Stefanos Aivazidis, Ina N. Safonova, Alexander N. Skiba. 2020-09-17. A generalisation of Schenkman's theorem. https://doi.org/10.1515/jgth-2020-0149

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