A fast implementation of the Monster group

arXiv2203.04223MaRDI QIDQ6505565FDOQ6505565

Abstract: Let

m a t h b b 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 representation

h o

of

m a t h b b M

with matrix coefficients in

m a t h b b Z [f r a c 12]

. We describe a new and very fast algorithm for performing the group operation in

m a t h b b M

. We assume that

m a t h b b M

is given by a certain set

G a m m a

of generators acting on the representation

h o

of

m a t h b b M

. For a small odd integer

p > 1

let

h o_{p}

be the representation

h o

with coefficients taken modulo

p

. In principle, we may represent elements of

m a t h b b M

by matrices acting on

h o_{p}

, but this is way too large for practical purposes. We construct a triple

(v_{1}, v^{+}, v^{-})

of elements of the module

h o_{15}

such that any

g i n m a t h b b M

can effectively be computed as a word in

G a m m a

from the images

(v_{1} g, v^{+} g, v^{-} g)

. An implementation of the group operation on

m a t h b b M

based on that idea multiplies two random elements of

m a t h b b M

in a bit less than 50~milliseconds on a standard PC with an Intel i7-8750H CPU at 4 GHz. This is about 100000 times faster than estimated by Wilson in 2013.

Mathematics Subject Classification ID

Representations of sporadic groups (20C34) (p)-adic representations of finite groups (20C11) Simple groups: sporadic groups (20D08) Computational methods for problems pertaining to group theory (20-08)

This page was built for publication: A fast implementation of the Monster group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505565)