Computing Sylow Subgroups in Permutation Groups

Abstract We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of a permutation group and for finding an element that conjugates one Sylow subgroup to another. The performance of the current implementations in the Magma system represents a significant improvement on previous implementations for many important classes of examples and generally extends the range of realistic applicability to groups of much larger degrees than before.

[1]  John J. Cannon,et al.  Programming with algebraic structures: design of the MAGMA language , 1994, ISSAC '94.

[2]  Gregory Butler,et al.  Computing Normalizers in Permutation Groups , 1983, J. Algorithms.

[3]  William M. Kantor,et al.  Sylow's Theorem in Polynomial Time , 1985, J. Comput. Syst. Sci..

[4]  Gregory Butler,et al.  Computing Sylow Subgroups of Permutation Groups Using Homomorphic Images of Centralizers , 1991, J. Symb. Comput..

[5]  Derek F. Holt,et al.  Computing Chief Series, Composition Series and Socles in Large Permutation Groups , 1997, J. Symb. Comput..

[6]  Gregory Butler,et al.  Computing in Permutation and Matrix Groups III: Sylow Subgroups , 1989, J. Symb. Comput..

[7]  Derek F. Holt The Computation of Normalizers in Permutation Groups , 1991, J. Symb. Comput..

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

[9]  William M. Kantor,et al.  On the Probability That a Group Element is p-Singular , 1995 .

[10]  William M. Kantor,et al.  Polynomial-Time Versions of Sylow's Theorem , 1988, J. Algorithms.

[11]  Gregory Butler,et al.  Fundamental Algorithms for Permutation Groups , 1991, Lecture Notes in Computer Science.

[12]  Gregory Butler Experimental comparison of algorithms for Sylow subgroups , 1992, ISSAC '92.

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

[14]  J. S. Leon,et al.  Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms , 1991, J. Symb. Comput..