论文信息 - Computing in the Monster - 字舞流文

Computing in the Monster

We discuss the feasibility of a general technique for computing in the Fischer?Griess Monster, and provide information on some of its subgroups which illustrates the use of computational techniques in solving a particular problem in this group.

Simon P. Norton

[1] L. H. Soicher. A New Uniqueness Proof for the Held Group , 1991 .

[2] S. P. Norton. The Atlas of Finite Groups - Ten Years on: Anatomy of the Monster: I , 1998 .

[3] Alexander J. E. Ryba,et al. Matrix generators for the Harada-Norton group , 1994, Exp. Math..

[4] J. H. Conway,et al. Groups, Combinatorics & Geometry: Hyperbolic reflections for the Bimonster and 3 Fi 24 , 1992 .

[5] J. Conway,et al. ATLAS of Finite Groups , 1985 .

[6] Robert L. Griess,et al. The friendly giant , 1982 .

[7] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..

[8] A simple construction for the Fischer-Griess monster group , 1985 .

[9] J. Conway,et al. Quilts and T-Systems , 1995 .

[10] Steve Linton,et al. Computer construction of the Monster , 1998 .