The Order of the Monster Finite Simple Group
Gerald H\"ohn, Martin Seysen

TL;DR
This paper computes the order of the Monster group using a computational approach based on counting specific algebraic elements, leveraging specialized software to handle large matrix calculations, and confirms its automorphism properties.
Contribution
It provides the first self-contained computational determination of the Monster group's order and verifies its automorphism group structure using new methods.
Findings
Determined the order of the Monster group.
Proved the Monster is the full automorphism group of the Griess algebra.
Identified two conjugacy classes of involutions in the Monster.
Abstract
We determine the order of the largest of the twenty-six sporadic simple groups known as the Monster, using a straightforward computational approach. The Monster is here defined as a subgroup of the symmetry group of the 196884-dimensional Griess algebra generated by a group of type and an additional triality automorphism. Our approach is based on counting arguments for certain idempotents of the Griess algebra called axes. Our proof is self-contained, requiring only established properties of the Conway group as the automorphism group of the Leech lattice, and some of its subgroups. Although our approach is conceptually simple, it requires extensive calculation inside a 196884-dimensional matrix group that current computer algebra systems cannot easily handle directly. Instead, we use the software package mmgroup, developed by the second author, which supports fast…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Geometric and Algebraic Topology · Algebraic structures and combinatorial models
