论文信息 - Computing Chief Series, Composition Series and Socles in Large Permutation Groups

Computing Chief Series, Composition Series and Socles in Large Permutation Groups

Abstract We describe the theory and implementation of practical algorithms for computing chief and composition series and socles in large permutation groups. The theory is valid for permutation degrees up to 10 000 000, and the current implementations in the Magma system are practical up to degrees of 1 000 000 for some examples. Several of the techniques involved are based on ideas of Kantor.

Derek F. Holt | John J. Cannon | D. Holt

[1] William M. Kantor,et al. Finding Composition Factors of Permutation Groups of Degree n < 10^6 , 1991, J. Symb. Comput..

[2] Gregory Butler,et al. Effective Computation with Group Homomorphisms , 1985, J. Symb. Comput..

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

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

[5] J. Dixon,et al. Permutation Groups , 1996 .

[6] László Babai,et al. Computing Composition Series in Primitive Groups , 1991, Groups And Computation.

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

[8] Derek F. Holt,et al. Computing Sylow Subgroups in Permutation Groups , 1997, J. Symb. Comput..

[9] Eugene M. Luks,et al. Permutation Groups and Polynomial-Time Computation , 1996, Groups And Computation.

[10] P. M. Neumann. Proceedings of Groups – St Andrews 1985: Some algorithms for computing with finite permutation groups , 1987 .

[11] Wieb Bosma,et al. Structural computations in finite permutation groups , 1992 .

[12] P. Cameron. FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS , 1981 .

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

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