Related papers: A computer-friendly construction of the monster

Let $\mathbb{M}$ be the Monster group, which is the largest sporadic finite simple group, and has first been constructed in 1982 by Griess. In 1985 Conway has constructed a 196884-dimensional rational epresentation $\rho$ of $\mathbb{M}$…

In this article we give an self contained existence proof for J. Conway's sporadic simple group Co_1 [4] using the second author's algorithm [14] constructing finite simple groups from irreducible subgroups of GL_n(2). Here n = 11 and the…

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…

Axial algebras of Monster type are a class of non-associative algebras which generalise the Griess algebra, whose automorphism group is the largest sporadic simple group, the Monster. The $2$-generated algebras, which are the building…

To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

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…

In this article we give self-contained existence proofs for the sporadic simple groups Co_2 and Fi_{22} using the second author's algorithm [10] constructing finite simple groups from irreducible subgroups of GL_n(2). These two sporadic…

We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

In 1997, John Conway constructed a $6$-fold transitive subset $M_{13}$ of permutations on a set of size $13$ for which the subset fixing any given point was isomorphic to the Mathieu group $M_{12}$. The construction was via a…

Majorana theory is an axiomatic tool introduced by A. A. Ivanov in 2009 for studying the Monster group M and its subgroups through the 196884-dimensional Conway-Griess-Norton algebra. The group U3(5) is the socle of the centralizer in M of…

In 1933 B.~H.~Neumann constructed uncountably many subgroups of ${\rm SL}_2(\mathbb Z)$ which act regularly on the primitive elements of $\mathbb Z^2$. As pointed out by Magnus, their images in the modular group ${\rm PSL}_2(\mathbb Z)\cong…

We employ the recently developed hybrid and mmgroup computational models for groups to calculate the character table of $N(\rm{2B}^5) \cong 2^{5+10+20}.( \rm{S}_3 \times \rm{L}_5 {2} )$, a maximal subgroup of the Monster sporadic simple…

Majorana theory was introduced by A. A. Ivanov as an axiomatic framework in which to study objects related to the Monster simple group and the Griess algebra. Since its inception, it has been used to construct a number of new and important…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

We study McKay's observation on the Monster simple group, which relates the 2A-involutions of the Monster simple group to the extended E_8 diagram, using the theory of vertex operator algebras (VOAs). We first consider the sublattices L of…

The classification of the maximal subgroups of the Monster $\mathbf{M}$ is a long-standing problem in finite group theory. According to the literature, the classification is complete apart from the question of whether $\mathbf{M}$ contains…

We discuss some categorical aspects of the objects that appear in the construction of the Monster and other sporadic simple groups. We define the basic representation of the categorical torus $\mathcal T$ classified by an even symmetric…

We construct super vertex operator algebras which lead to modules for moonshine relations connecting the four smaller sporadic simple Mathieu groups with distinguished mock modular forms. Starting with an orbifold of a free fermion theory,…

The prime graph, or Gruenberg--Kegel graph, of a finite group $G$ is the graph $\Gamma(G)$ whose vertices are the prime divisors of $|G|$, and whose edges are the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A finite…