if I remember correctly, then CAYLEY used to have a very fast function
which computed the normalizer of a permutation group on the letters
[1..n] inside the symmetric group on these letters.
Is there a substitute for this in GAP? Something like
works in general already unusably slowly already for n>25.
- Peter M\"uller