Constructing Permutation Representations for Matrix Groups

New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the computation of a strong generating set. In addition, we present an elementary test for checking the simplicity of the permutation image. The theory has been successfully tested on a representation of the sporadic simple groupLy, discovered by Lyons(1972). With noa prioriassumptions, we find a permutation representation of degree 9606125 on a conjugacy class of subgroups of order 3, find the order of the resulting permutation group, and verify simplicity. A Monte Carlo variation of the algorithm was used to achieve better space and time efficiency. The construction of the permutation representation required four CPU days on a SPARCserver 670MP with 64 MB. The permutation representation was used implicitly in the sense that the group element was stored as a matrix, and its permutation action on a “point” was determined using a pre-computed data structure. Thus, additional computations required little additional space. The algorithm has also been implemented using the MasPar MP-1 SIMD parallel computer and 8 SPARC-2's running under MPI. The results of those parallel experiments are briefly reviewed.

[1]  László Babai,et al.  Nearly linear time algorithms for permutation groups with a small base , 1991, ISSAC '91.

[2]  Daniel Gorenstein.  The Classification of Finite Simple Groups , 1983 .

[3]  Robert T. Curtis.  LOW RANK REPRESENTATIONS AND GRAPHS FOR SPORADIC GROUPS (Australian Mathematical Society Lecture Series 8) , 1998 .

[4]  Derek F. Holt,et al.  Computing Matrix Group Decompositions with Respect to a Normal Subgroup , 1996 .

[5]  Message Passing Interface Forum.  MPI: A message - passing interface standard , 1994 .

[6]  Cheryl E. Praeger,et al.  Low rank representations and graphs for sporadic groups , 1996 .

[7]  Endre Szemerédi,et al.  On the Complexity of Matrix Group Problems I , 1984, FOCS.

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  Gene Cooperman,et al.  STAR/MPI: binding a parallel library to interactive symbolic algebra systems , 1995, ISSAC '95.

[10]  Derek F. Holt,et al.  Testing modules for irreducibility , 1994, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[11]  László Babai,et al.  Local expansion of vertex-transitive graphs and random generation in finite groups , 1991, STOC '91.

[12]  Holger W. Gollan,et al.  Construction of a 45,694-dimensional simple module of Lyons' sporadic group over GF(2) , 1997 .

[13]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[14]  Charles C. Sims.  The Existence and Uniqueness of Lyons' Group , 1973 .

[15]  Charles C. Sims,et al.  Computation with permutation groups , 1971, SYMSAC '71.

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

[17]  B. Huppert.  Endliche Gruppen I , 1967 .

[18]  Derek F. Holt,et al.  Testing Matrix Groups for Primitivity , 1996 .

[19]  Robert Beals,et al.  Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17 , 1991, Groups And Computation.

[20]  Gregory Butler,et al.  The Schreier algorithm for matrix groups , 1976, SYMSAC '76.

[21]  Gene Cooperman,et al.  Combinatorial Tools for Computational Group Theory , 1991, Groups And Computation.

[22]  Bryant W. York,et al.  Constructing permutation representations for large matrix groups , 1994, ISSAC '94.

[23]  László Babai,et al.  Las Vegas algorithms for matrix groups , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[24]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[25]  Eugene M. Luks,et al.  Computing in solvable matrix groups , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[26]  Gregory Butler,et al.  Cayley, Version 4: The User Language , 1988, ISSAC.

[27]  John J. Cannon,et al.  Computing in permutation and matrix groups. I. Normal closure, commutator subgroups, series , 1982 .

[28]  Richard Lyons,et al.  Evidence for a new finite simple group , 1972 .

[29]  Gene Cooperman,et al.  Computing with matrix groups using permutation representations , 1995, ISSAC '95.

[30]  Á. Seress.  Nearly Linear Time Algorithms for Permutation Groups: An Interplay Between Theory and Practice , 1998 .