> 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 _______________________________________________ Forum mailing list Forum@gap-system.org https://mail.gap-system.org/mailman/listinfo/forum
