Abstract
A base for a permutation group G acting on a set Ω is a sequence ℬ of points of Ω such that the pointwise stabiliser Gℬ is trivial. Denote the minimum size of a base for G by b(G) There is a natural greedy algorithm for constructing a base of relatively small size; denote by 𝒢(G) the maximum size of a base it produces. Motivated by a longstanding conjecture of Cameron, we determine 𝒢(G) for every almost simple primitive group G with socle a sporadic simple group, showing that 𝒢(G) = b(G) .
| Original language | English |
|---|---|
| Pages (from-to) | 1079-1094 |
| Number of pages | 16 |
| Journal | Journal of Group Theory |
| Volume | 28 |
| Issue number | 5 |
| Early online date | 14 Mar 2025 |
| DOIs | |
| Publication status | Published - 1 Sept 2025 |
Fingerprint
Dive into the research topics of 'Greedy base sizes for sporadic simple groups'. Together they form a unique fingerprint.Student theses
-
All about that base
del Valle, C. (Author), Roney-Dougal, C. M. (Supervisor) & Cameron, P. J. (Supervisor), 2 Dec 2025Student thesis: Doctoral Thesis (PhD)