GAP Project repository
  

Isomorphism

Need:
3
 Time:
4
Component: Generic groups
Contact: Alexander Hulpke
( hulpke@math.colostate.edu)
Last Update: 2001/9/24
Math:
4
 Program:
4

Description

The algorithm by M. Smith for the automorphism group of a solvable group can be (and has been by Cannon and Holt) generalized to the nonsolvable case and also generalized to isomorphism computation.

The automorphism algorithm is in preparation, the isomorphism variant is not yet done.

A further improvements would be to use pretabulated information for almost simple subgroups

References

D. F. Holt, in {\it Groups and computation, III (Columbus, OH, 1999)}, 201--208, de Gruyter, Berlin, 2001; CNO CMP 1 829 481

GAP home page