^ From:

> ^ Subject:

Dear Forum-members,

to speed up a certain grouptheoretic algorithm it would be useful to have

the automorphismgroup of a finite group. In the manual I found no hint to

compute the automorphism group of a given group. I have some idea how to do

it, but I think the need to have an automorphism group of a group must have

arisen earlier. So I would like to know, whether someone has used such an

algorithm before and could give me some advice. To be a bit more precise as

input the group would be given as a subgroup of a permutation group generated

by suitable permutations, e. g. d4 := Group( (1,2)(3,4), (1,3) ).

Greetings Olaf Ruhe

> < [top]