Modular Functions and the Monstrous Exponents
John F. R. Duncan, Holly Swisher
TL;DR
This paper introduces a modular function-based method to explain the prime exponents in the order of the monster finite simple group for primes greater than 3.
Contribution
It provides a novel modular functions approach to understanding the prime exponents in the monster group's order, extending previous algebraic methods.
Findings
Identifies a modular function pattern for prime exponents
Applicable to primes larger than 3
Enhances understanding of the monster group's structure
Abstract
We present a modular function-based approach to explaining, for primes larger than 3, the exponents that appear in the prime decomposition of the order of the monster finite simple group.
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
TopicsAdvanced Topology and Set Theory · Homotopy and Cohomology in Algebraic Topology · Computability, Logic, AI Algorithms