Explicit construction of the maximal subgroups of the Monster

Abstract

Seysen's Python package mmgroup provides functionality for fast computations within the sporadic simple group M, the Monster. The aim of this work is to present an mmgroup database of maximal subgroups of M: for each conjugacy class C of maximal subgroups in 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 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 M has a maximal subgroup PSL2(59), and hence identify a new maximal subgroup 59:29.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…