SearcharxivSearch

arXiv · 1803.10955

On base sizes for almost simple primitive groups

Abstract

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite almost simple primitive permutation group, with socle $G_0$ and point stabilizer $H$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer is trivial; the base size of $G$, denoted $b(G)$, is the minimal size of a base. We say that $G$ is standard if $G_0 = A_n$ and $\Omega$ is an orbit of subsets or partitions of $\{1, \ldots, n\}$, or if $G_0$ is a classical group and $\Omega$ is an orbit of subspaces (or pairs of subspaces) of the natural module for $G_0$. The base size of a standard group can be arbitrarily large, in general, whereas the situation for non-standard groups is rather more restricted. Indeed, we have $b(G) \leqslant 7$ for every non-standard group $G$, with equality if and only if $G$ is the Mathieu group ${\rm M}_{24}$ in its natural action on $24$ points. In this paper, we extend this result by classifying the non-standard groups with $b(G)=6$. The main tools include recent work on bases for actions of simple algebraic groups, together with probabilistic methods and improved fixed point ratio estimates for exceptional groups of Lie type.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy C. Burness. 2018-03-29. On base sizes for almost simple primitive groups. https://arxiv.org/abs/1803.10955

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