Computing canonical images in permutation groups with Graph Backtracking
Group Theory
2023-09-12 v4
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.
Keywords
Cite
@article{arxiv.2209.02534,
title = {Computing canonical images in permutation groups with Graph Backtracking},
author = {Christopher Jefferson and Rebecca Waldecker and Wilf A. Wilson},
journal= {arXiv preprint arXiv:2209.02534},
year = {2023}
}
Comments
This is a revised version, as re-submitted