The Monster and black-box groups

2013/10/18 by Robert A. Wilson, Wilson, Robert A.
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1310.5016

openalex publication_date 2013/10/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We discuss ways in which the black-box model for computation is or is not applicable to the Monster sporadic simple group. Conversely, we consider whether methods of computation in the Monster can be generalised to other situations, for example to groups of `cross-characteristic' type.

Related

• The Monster group is a completion of the Goldschmidt G3-amalgam
• Vertex operators and sporadic groups
• Centralisers of Involutions in Black Box Groups
• Some steps in the verification of the ordinary character table of the Monster group
• Black Box White Arrow