SearcharxivSearch

arXiv · 1711.01686

On classes of finite groups with simple non-abelian chief factors

Abstract

Let $\mathfrak{J}$ be a class of non-abelian simple groups and $\mathfrak{X}$ be a class of groups. A chief factor $H/K$ of a group $G$ is called $\mathfrak{X}$-central in $G$ provided $(H/K)\rtimes G/C_G(H/K)\in\mathfrak{X}$. We say that $G$ is a $\mathfrak{J}cs$-$\mathfrak{X}$-\emph{group} if every chief $\mathfrak{X}$-factor of $G$ is $\mathfrak{X}$-central and other chief factors of $G$ are simple $\mathfrak{J}$-groups. We use $\mathfrak{X}_{\mathfrak{J}cs}$ to denote the class of all $\mathfrak{J}cs$-$\mathfrak{X}$-groups. A subgroup $U$ of a group $G$ is called $\mathfrak{X}$-\emph{maximal} in $G$ provided that $(a)$ $U\in\mathfrak{X}$, and $(b)$ if $U\leq V \leq G$ and $V\in\mathfrak{X}$, then $U = V$. In this paper we described the structure of $\mathfrak{J}cs$-$\mathfrak{H}$-groups for a solubly saturated formation $\mathfrak{H}$ and all hereditary saturated formations $\mathfrak{F}$ containing all nilpotent groups such that the $\mathfrak{F}_{\mathfrak{J}cs}$-hypercenter of $G$ coincides with the intersection of all $\mathfrak{F}_{\mathfrak{J}cs}$-maximal subgroups of $G$ for every group $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

V. I. Murashka. 2017-11-06. On classes of finite groups with simple non-abelian chief factors. https://arxiv.org/abs/1711.01686

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