SearcharxivSearch

arXiv · 2311.04057

On finite permutation groups of rank three

Abstract

The classification of the finite primitive permutation groups of rank $3$ was completed in the 1980s and this landmark achievement has found a wide range of applications. In the general transitive setting, a classical result of Higman shows that every finite imprimitive rank $3$ permutation group $G$ has a unique non-trivial block system $\mathcal{B}$ and this provides a natural way to partition the analysis of these groups. Indeed, the induced permutation group $G^{\mathcal{B}}$ is $2$-transitive and one can also show that the action induced on each block in $\mathcal{B}$ is also $2$-transitive (and so both induced groups are either affine or almost simple). In this paper, we make progress towards a classification of the rank $3$ imprimitive groups by studying the case where the induced action of $G$ on a block in $\mathcal{B}$ is of affine type. Our main theorem divides these rank $3$ groups into four classes, which are defined in terms of the kernel of the action of $G$ on $\mathcal{B}$. In particular, we completely determine the rank $3$ semiprimitive groups for which $G^{\mathcal{B}}$ is almost simple, extending recent work of Baykalov, Devillers and Praeger. We also prove that if $G$ is rank $3$ semiprimitive and $G^{\mathcal{B}}$ is affine, then $G$ has a regular normal subgroup which is a special $p$-group for some prime $p$.

Explore related subjects

Keep this discovery

BibTeXRIS

Hong Yi Huang, Cai Heng Li, Yan Zhou Zhu. 2023-11-07. On finite permutation groups of rank three. https://arxiv.org/abs/2311.04057

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