Ferret - GAP package. Ferret implements highly efficient implementations of a range of search algorithms on permutation groups. These algorithms fall into two broad categories: Algorithms which find groups and cosets with particular properties. This include graph automorphisms, stabilizers and group intersection. Canonical Images. This involves finding the canonical image of an object (graph, set, list, transformation and others) in a given group of coset. If you are interested in if Ferret can be applied to another problem, please contact the authors, who will be happy to look into if your problem can be solved with Ferret.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Jefferson, Christopher; Jonauskyte, Eliza; Pfeiffer, Markus; Waldecker, Rebecca: Minimal and canonical images (2019)
- Jefferson, Christopher; Pfeiffer, Markus; Waldecker, Rebecca: New refiners for permutation group search (2019)