Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

An inductive schema for computing conjugacy classes in permutation groups


Author: Greg Butler
Journal: Math. Comp. 62 (1994), 363-383
MSC: Primary 20B40; Secondary 20-04
DOI: https://doi.org/10.1090/S0025-5718-1994-1208219-2
MathSciNet review: 1208219
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: An approach to computing the conjugacy classes of elements of large permutation groups is presented in detail, and a prototype implementation is described. The approach builds on recent efficient algorithms for computing conjugacy classes of p-groups, and for computing Sylow subgroups of large permutation groups. Classes of elements of composite order are determined by recursively analyzing quotients of centralizers of p-elements.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 20B40, 20-04

Retrieve articles in all journals with MSC: 20B40, 20-04


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1994-1208219-2
Keywords: Conjugacy class, permutation group, algorithm
Article copyright: © Copyright 1994 American Mathematical Society