arXiv Analytics

Sign in

arXiv:2209.02534 [math.GR]AbstractReferencesReviewsResources

Computing canonical images in permutation groups with Graph Backtracking

Chris Jefferson, Rebecca Waldecker, Wilf A. Wilson

Published 2022-09-06Version 1

We describe a new algorithm for finding a canonical image of an object under the action of a finite permutation group. This algorithm builds on previous work using Graph Backtracking, which extends Jeffrey Leon's Partition Backtrack framework. Our methods generalise both Nauty and Steve Linton's Minimal image algorithm.

Categories: math.GR
Subjects: 20B05, 20-08
Related articles: Most relevant | Search more
arXiv:1410.0420 [math.GR] (Published 2014-10-02)
Permutation Groups and Orbits on Power Sets
arXiv:2402.13672 [math.GR] (Published 2024-02-21, updated 2024-03-15)
Permutation groups of prime power degree and $p$-complements
arXiv:1712.03688 [math.GR] (Published 2017-12-11)
On the Saxl graph of a permutation group

Links

Toolbox