SearcharxivSearch

arXiv · 2406.18482

Constructing regular saturated formations of finite soluble groups

Abstract

For a formation $\mathfrak{F}$ of finite groups consider a graph whose vertices are elements of a finite group and two vertices are connected by an edge if and only if they generates non-$\mathfrak{F}$-group as elements of a group. A hereditary formation $\mathfrak{F}$ is called regular if the set of all isolated vertices of the described graph coincides with the intersection of all maximal $\mathfrak{F}$-subgroups in every group. The constructive description of saturated regular formations of soluble groups which improves the results of Lucchini and Nemmi is obtained in this paper. In particular, it is showed that saturated regular non-empty formations of soluble groups are just hereditary formations $\mathfrak{F}$ of soluble groups that contains every group all whose cyclic primary subgroups are $K$-$\mathfrak{F}$-subnormal. Also we prove that the lattice of saturated regular formations of soluble groups is lattice isomorphic to the Steinitz's lattice.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Viachaslau I. Murashka. 2024-06-26. Constructing regular saturated formations of finite soluble groups. https://arxiv.org/abs/2406.18482

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