GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
Keyword(s):
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.
2016 ◽
Vol 94
(2)
◽
pp. 254-265
2019 ◽
Vol 12
(05)
◽
pp. 1950081
Keyword(s):
Keyword(s):
2019 ◽
Vol 102
(1)
◽
pp. 77-90
Keyword(s):
2016 ◽
Vol 09
(03)
◽
pp. 1650054
Keyword(s):
2019 ◽
Vol 18
(12)
◽
pp. 1950230
Keyword(s):
1964 ◽
Vol 16
◽
pp. 435-442
◽
Keyword(s):
1970 ◽
Vol 3
(2)
◽
pp. 273-276