Hostname: page-component-5db58dd55d-d6ndz Total loading time: 0 Render date: 2026-06-10T18:30:40.043Z Has data issue: false hasContentIssue false

GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS

Published online by Cambridge University Press:  30 June 2020

ANDREA LUCCHINI
Affiliation:
Dipartimento di Matematica Tullio Levi-Civita, Università degli Studi di Padova, 35121-IPadova, Italy; lucchini@math.unipd.it
CLAUDE MARION
Affiliation:
CMUP, Departamento de Matemática, Universidade do Porto, 4169-007Porto, Portugal; claude.marion@fc.up.pt
GARETH TRACEY
Affiliation:
Department of Mathematical Sciences, University of Bath, BathBA2 7AY, UK; gmt29@bath.ac.uk

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For a finite group $G$, let $d(G)$ denote the minimal number of elements required to generate $G$. In this paper, we prove sharp upper bounds on $d(H)$ whenever $H$ is a maximal subgroup of a finite almost simple group. In particular, we show that $d(H)\leqslant 5$ and that $d(H)\geqslant 4$ if and only if $H$ occurs in a known list. This improves a result of Burness, Liebeck and Shalev. The method involves the theory of crowns in finite groups.

Information

Type
Algebra
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2020