A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Groups, Combinatorics and Geometry
We give a survey of computational methods and results concerning the Monster sporadic simple group. There are now three computer constructions of the Monster which are proving effective in answering real questions about this group. The first construction over the field of two elements is the fastest for calculations, and has been used to show the group is a Hurwitz group. The second construction over the field of three elements, uses an involution centralizer as the heart of the construction,doi:10.1142/9789812564481_0020 fatcat:goq6z5gx3rbd7kh5ohzfreg6ly