This chapter describes the GAP package Ferret. 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.
Ferret automatically installs methods which replace GAP's a number of GAP's built-in functionality:
Intersection for a list of permutation groups.
Stabilizer(G,S,Action) for a permutation group G, and the actions:
OnSets
OnOnSets
OnSetsDisjointSets
OnSetsSets
OnTuples
OnPairs
OnDirectedGraph
Stabilizer(G, S) for a permutation group G and a:
permutation
transformation
partial permutation
If you would like to disable this functionality, you can use 1.1-1.
‣ EnableFerretOverloads ( [active] ) | ( function ) |
if active (a bool) is true, then enable Ferret specialisations of Intersection and Stabilizer. Call with active false to disable.
‣ FerretOverloadsEnabled ( ) | ( function ) |
Return if Ferret specialisations of Intersection and Stabilizer are currently enabled.
generated by GAPDoc2HTML