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) <= 5 and that d(H) >= 5 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.
GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
Lucchini, ANDREA
;Marion, C;Tracey, G
2020
Abstract
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) <= 5 and that d(H) >= 5 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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
generating_maximal_subgroups_of_finite_almost_simple_groups.pdf
accesso aperto
Tipologia:
Published (publisher's version)
Licenza:
Creative commons
Dimensione
693.1 kB
Formato
Adobe PDF
|
693.1 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
