English

The maximal size of a minimal generating set

Group Theory 2023-07-20 v2

Abstract

A generating set for a finite group GG is said to be minimal if no proper subset generates GG, and m(G)m(G) denotes the maximal size of a minimal generating set for GG. We prove a conjecture of Lucchini, Moscatiello and Spiga by showing that there exist a,b>0a,b > 0 such that any finite group GG satisfies m(G)aδ(G)bm(G) \leq a \cdot \delta(G)^b, for \delta(G) = \sum_{\text{p prime}} m(G_p) where GpG_p is a Sylow pp-subgroup of GG. To do this, we first bound m(G)m(G) for all almost simple groups of Lie type (until now, no nontrivial bounds were known except for groups of rank 11 or 22). In particular, we prove that there exist a,b>0a,b > 0 such that any finite simple group GG of Lie type of rank rr over the field Fpf\mathbb{F}_{p^f} satisfies r+ω(f)m(G)a(r+ω(f))br + \omega(f) \leq m(G) \leq a(r + \omega(f))^b, where ω(f)\omega(f) denotes the number of distinct prime divisors of ff. In the process, we confirm a conjecture of Gill and Liebeck that there exist a,b>0a,b > 0 such that a minimal base for a faithful primitive action of an almost simple group of Lie type of rank rr over Fpf\mathbb{F}_{p^f} has size at most arb+ω(f)ar^b + \omega(f).

Keywords

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

R2 v1 2026-06-28T09:20:29.417Z