The maximal size of a minimal generating set
Abstract
A generating set for a finite group is said to be minimal if no proper subset generates , and denotes the maximal size of a minimal generating set for . We prove a conjecture of Lucchini, Moscatiello and Spiga by showing that there exist such that any finite group satisfies , for \delta(G) = \sum_{\text{p prime}} m(G_p) where is a Sylow -subgroup of . To do this, we first bound for all almost simple groups of Lie type (until now, no nontrivial bounds were known except for groups of rank or ). In particular, we prove that there exist such that any finite simple group of Lie type of rank over the field satisfies , where denotes the number of distinct prime divisors of . In the process, we confirm a conjecture of Gill and Liebeck that there exist such that a minimal base for a faithful primitive action of an almost simple group of Lie type of rank over has size at most .
Cite
@article{arxiv.2303.09509,
title = {The maximal size of a minimal generating set},
author = {Scott Harper},
journal= {arXiv preprint arXiv:2303.09509},
year = {2023}
}
Comments
10 pages; to appear in Forum of Mathematics, Sigma