{
  "id": "2209.02534",
  "version": "v1",
  "published": "2022-09-06T14:36:04.000Z",
  "updated": "2022-09-06T14:36:04.000Z",
  "title": "Computing canonical images in permutation groups with Graph Backtracking",
  "authors": [
    "Chris Jefferson",
    "Rebecca Waldecker",
    "Wilf A. Wilson"
  ],
  "categories": [
    "math.GR"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-09-06T14:36:04.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "20B05",
      "20-08"
    ],
    "keywords": [
      "permutation group",
      "computing canonical images",
      "graph backtracking",
      "steve lintons minimal image algorithm",
      "extends jeffrey leons partition backtrack"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}