论文信息 - Computing conjugacy class representatives in permutation groups

Computing conjugacy class representatives in permutation groups

Abstract We describe a significantly improved algorithm for computing the conjugacy classes of a finite permutation group with trivial soluble radical. We rely on existing methods for groups that are almost simple, and we are concerned here only with the reduction of the general case to the almost simple case.

Derek F. Holt | John Cannon

[1] Derek F. Holt,et al. Computing maximal subgroups of finite groups , 2004, J. Symb. Comput..

[2] Miss A.O. Penney. (b) , 1974, The New Yale Book of Quotations.

[3] J. Neubüser,et al. Some remarks on the computation of conjugacy classes of soluble groups , 1989, Bulletin of the Australian Mathematical Society.

[4] E. O'Brien,et al. Handbook of Computational Group Theory , 2005 .

[5] Derek F. Holt,et al. Automorphism group computation and isomorphism testing in finite groups , 2003, J. Symb. Comput..

[6] John J. Cannon,et al. On the computation of conjugacy classes in permutation groups , 1997, ISSAC.

[7] Alexander Hulpke,et al. Conjugacy classes in finite permutation groups via homomorphic images , 2000, Math. Comput..

[8] Joachim Neubüser,et al. An algorithm for the computation of conjugacy classes and centralizes in p-groups , 1979, EUROSAM.

[9] G. Butler. An inductive schema for computing conjugacy classes in permutation groups , 1994 .