Greedy base sizes for sporadic simple groups

Coen del Valle*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)1079-1094
Number of pages16
JournalJournal of Group Theory
Volume28
Issue number5
Early online date14 Mar 2025
DOIs
Publication statusPublished - 1 Sept 2025

Fingerprint

Dive into the research topics of 'Greedy base sizes for sporadic simple groups'. Together they form a unique fingerprint.

Cite this