SearcharxivSearch

arXiv · 2404.18753

Fixers and derangements of finite permutation groups

Abstract

Let $G\leqslant\mathrm{Sym}(\Omega)$ be a finite transitive permutation group with point stabiliser $H$. We say that a subgroup $K$ of $G$ is a fixer if every element of $K$ has fixed points, and we say that $K$ is large if $|K| \geqslant |H|$. There is a special interest in studying large fixers due to connections with Erd\H{o}s-Ko-Rado type problems. In this paper, we classify up to conjugacy the large fixers of the almost simple primitive groups with socle $\mathrm{PSL}_2(q)$, and we use this result to verify a special case of a conjecture of Spiga on permutation characters. We also present some results on large fixers of almost simple primitive groups with socle an alternating or sporadic group.

Explore related subjects

Keep this discovery

BibTeXRIS

Hong Yi Huang, Cai Heng Li, Yi Lin Xie. 2024-04-29. Fixers and derangements of finite permutation groups. https://arxiv.org/abs/2404.18753

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