Make a better system of GAP refiner objects for `BacktrackKit`/`GraphBacktracking`/`Vole` - Githubissues

peal / vole

A GAP package for backtrack search in permutation groups with graphs

https://peal.github.io/vole

Mozilla Public License 2.0

8 stars 2 forks source link

Make a better system of GAP refiner objects for `BacktrackKit`/`GraphBacktracking`/`Vole` #25

Open wilfwilson opened 3 years ago

wilfwilson commented 3 years ago

We also want to be able to distinguish those refiners that can be used in a canonical image search from those that cannot.

Categories

IsBTKitRefiner
IsGBRefiner
IsVoleRefiner

GraphBacktracking should take BacktrackKit refiners. Vole should be able to take BacktrackKit and GraphBacktracking refiners. (Should BacktrackKit be able to take certain kinds of GraphBacktracking refiners? Or just ignore this?)

Attributes/properties known at creation

LargestRequiredPoint
IsKnownPerfectRefiner (if we know a priori that a refiner is perfect)
IsCanonicalCompatible

Additional attributes/properties that require computation

IsPerfectRefiner (is it even possible to always compute the answer to the question of perfectness?)
UnderlyingSet (the set of permutations that you are refining for, e.g. the normaliser)

wilfwilson commented 3 years ago

When executing a group search, if some of your refiners have known sizes for their groups, then the order of the answer would have to divide the gcd of all those numbers. Perhaps that information could be used usefully during the search? (And obviously if the gcd is 1, then the search would be skipped).