search

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

Support the action `OnSetsDigraphs` everywhere that we support `OnDigraphs` #39

Closed wilfwilson closed 2 years ago

wilfwilson commented 2 years ago

I am working on defining these actions in the Digraphs package https://github.com/digraphs/Digraphs/pull/449. (However, we do not need to wait before that is finished and merged and released before implementing this in Vole; we can conditionally define OnTuplesDigraphs and OnSetsDigraphs as dummy objects if Digraphs has not already done so.)

OnTuplesDigraphs is the easy one; we should just return a list of the appropriate OnDigraphs constraints/refiners.

OnSetsDigraphs will involve having a function that converts a set of digraphs into a single digraph with extra vertices. This turns a stabiliser/transporter problem for a set of digraphs into a stabiliser/transporter problem of a single (extended) digraph. If we want this to work nicely with canonical images, which we do, we may have to be careful about how we do this. Caution needed!

wilfwilson commented 2 years ago

I added GB_Con.SetDigraphs to GraphBacktracking, now we just need to make sure that the documentation is consistent with the state of the implementation - but that is always the case and I don't think we need a particular issue for this.