REVIEW 1 cited by
Explicit construction of the maximal subgroups of the Monster
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Seysen's Python package mmgroup provides functionality for fast computations within the sporadic simple group $\mathbb{M}$, the Monster. The aim of this work is to present an mmgroup database of maximal subgroups of $\mathbb{M}$: for each conjugacy class $C$ of maximal subgroups in $\mathbb{M}$, we construct explicit group elements in mmgroup and prove that these elements generate a group in $C$. Our generators and the computations verifying correctness are available in accompanying code. The maximal subgroups of $\mathbb{M}$ have been classified in a number of papers spanning several decades; our work constitutes an independent verification of these constructions. We also correct the claim that $\mathbb{M}$ has a maximal subgroup $\mathrm{PSL}_2({59})$, and hence identify a new maximal subgroup $59{:}29$.
Forward citations
Cited by 1 Pith paper
-
Finite permutation groups with quasi-semiregular elements
Finite primitive permutation groups admitting a quasi-semiregular element have O'Nan-Scott type HA, AS, PA, SD or CD, and the alternating and sporadic almost simple cases are classified explicitly.
Discussion (0). Continue with ORCID to comment.