SearcharxivSearch

arXiv · 2402.13672

Permutation groups of prime power degree and $p$-complements

Abstract

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime to $p$ in such representations). We deduce that every primitive permutation group of prime power degree has a regular subgroup, and that any two faithful primitive representations of a group, of the same prime power degree, are equivalent under automorphisms. In general, $p$-complements in a finite group can be inequivalent under automorphisms, or even non-isomorphic. We extend examples of such phenomena due to Buturlakin, Revin and Nesterov by showing that the number of inequivalent classes of complements can be arbitrarily large. Questions concerning the existence of prime power representations and $p$-complements in groups with socle ${\rm PSL}_d(q)$ are related to some difficult open problems in Number Theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Gareth A. Jones, Sezgin Sezer. 2024-02-21. Permutation groups of prime power degree and $p$-complements. https://arxiv.org/abs/2402.13672

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