Pith. sign in

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

arxiv 2411.12230 v1 pith:NICMMYWR submitted 2024-11-19 math.GR

classification math.GR
keywords maximalmathbbsubgroupsgroupmmgroupcomputationselementsexplicit
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Finite permutation groups with quasi-semiregular elements

    math.GR 2025-07 conditional novelty 6.0 of 10

    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.

Pith tools