Automorphism group computation and isomorphism testing in finite groups

Authors:
John J. Cannon;Derek F. Holt
Affiliations:
School of Mathematics, University of Sydney, Sydney, Australia;Mathematics Institute, University of Warwick, CV4 7AL Coventry, UK
Venue:
Journal of Symbolic Computation
Year:
2003

Citing 6
Cited 4

Computing with endomorphism ringsof modular representations

Journal of Symbolic Computation
Computing in quotient groups

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computing with subgroups of automorphism groups of finite groups

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computing chief series, composition series and socles in large permutation groups

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Computing the subgroups of a permutation group

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the second Magma conference

A New Property of Hamming Graphs and Mesh of d-ary Trees

Computer Mathematics
Computing automorphisms of semigroups

Journal of Symbolic Computation
Symmetries of knowledge bases

Annals of Mathematics and Artificial Intelligence
Polynomial-time isomorphism test for groups with no abelian normal subgroups

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new method for computing the automorphism group of a finite permutation group and for testing two such groups for isomorphism is described. Some performance statistics are included for an implementation of these algorithms in the Magma language.