SearcharxivSearch

arXiv · 2312.15780

On the finite solvable $PNC$-groups

Abstract

A subgroup $H$ of a finite group $G$ is said to be an NC-subgroup of $G$, if $ H^G N_G (H) =G$, where $H^G$ denotes the normal closure of $H$ in $G$. A finite group $G$ is called a PNC-group, if any subgroup of $G$ is an NC-subgroup of $G$, and $G$ is said to be an ON-group, if for any subgroup $H$ of $G$, either $N_G (H)=H,\,H^G=G$, or $H \unlhd G$. In this paper, we firstly investigate the basic properties of solvable PNC-groups, and then give several sufficient conditions for $G$ to be a solvable PNC-group. In the end of this paper, we discover some characterizations for minimal non-ON-groups, ON-groups, non-abelian simple groups whose second maximal subgroups are solvable PNC-groups and groups whose proper (maximal) subgroups are solvable PNC-groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Shengmin Zhang, Zhencai Shen. 2023-12-25. On the finite solvable $PNC$-groups. https://arxiv.org/abs/2312.15780

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