[GAP Forum] Canonical form for some small groups and efficient characterisation of the generalized symmetric groups

[Rubey Martin]

> In the same way that nasty can calculate both graph automorphism and graph canonical image, I am working on extending Partition Backtrack to solve both the conjugacy problem and the canonical image problem for groups, expect a release next year.

This sounds like wonderful news!

> However, having a “sensible string” is probably impossible. Nauty doesn’t produce a “sensible string” to describe the automorphism of graphs.

I should have been clearer: a short list of generators for the representative of the conjugacy class would be just fine.  I am guessing that that's not impossible, right?

Martin