SearcharxivSearch

arXiv · 2202.09765

Notes on finite totally $2$-closed permutation groups

Abstract

Let $N$ be a normal subgroup of a finite group $G$. For a faithful $N$-set $\Delta$, applying the university embedding theorem one can construct a faithful $G$-set $\Omega$. In this short note, it is proved that if the $2$-closure of $N$ in $\Omega$ is equal to $N$, then the $2$-closure of $N$ in $\Delta$ is also equal to $N$; in addition, it is proved that any abelian normal subgroup of a finite totally $2$-closed group is cyclic; finally, it is proved that if a finite nilpotent group is a direct of two nilpotent subgroups where the two factors have coprime orders and both of them are totally 2-closed then G is totally $2$-closed. As corollaries, several well-known results on finite totally 2-closed groups are reproved in more simple ways.

Explore related subjects

Keep this discovery

BibTeXRIS

Gang Chen, Qing Ren. 2022-02-20. Notes on finite totally $2$-closed permutation groups. https://arxiv.org/abs/2202.09765

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