Computing canonical images in permutation groups with Graph Backtracking

Authors Christopher Jefferson, Rebecca Waldecker, Wilf A. Wilson

Publication date 6 September 2022

Has companion code repository https://github.com/peal/canonical-gb-experiments

Computational methods for problems pertaining to group theory (20-08) General theory for finite permutation groups (20B05)

Abstract: 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.

This page was built for publication: Computing canonical images in permutation groups with Graph Backtracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409851)