Searcharxiv⌕ Search

arXiv · 2611.15410

On the orders of irreducible subgroups of finite classical groups

Abstract

Let $G$ be a finite almost simple classical group over $\mathbb{F}_q$ with socle $G_0$ and natural module $V$ of dimension $n$. Let $H$ be a core-free maximal subgroup of $G$. By a well-known theorem of Aschbacher, either $H$ is contained in one of eight subgroup collections that are defined in terms of the geometry of $V$, or $H$ is almost simple and the embedding of $H$ in $G$ arises from an absolutely irreducible representation of a covering group of the socle of $H$. We write $\mathcal{S}$ for the latter collection of irreducibly embedded almost simple subgroups. Determining the subgroups in $\mathcal{S}$ is an intractable problem, in general, which has only been fully resolved in low dimensions. However, many applications require some control on the subgroups in $\mathcal{S}$, expressed in terms of their order, or properties of their elements, for example. Extending a theorem of Liebeck from the 1980s, and building on later work by Burness, Guralnick and Saxl, in this paper we determine all the subgroups $H \in \mathcal{S}$ satisfying the lower bound $|H| \geqslant q^n$. We also highlight a recent application of our main result to a problem in finite geometry.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timothy C. Burness, Lei Wang. 2026-11-11. On the orders of irreducible subgroups of finite classical groups. https://searcharxiv.com/abs/2611.15410

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗