Questions on Orbital Graphs
Previous work on orbital graphs has shown that they are a powerful pruning tool in backtrack algorithms. In this article we consider a few questions that are relevant from this perspective, focussing on properties of orbital graphs that can be detected by an efficient algorithm. Roughly speaking, the challenge is to decide when to use orbital graphs and, possibly, how to choose a “best” orbital graph, and to make this decision early in the algorithm at low computational costs. In this note we discuss how to decide whether or not a given digraph is an orbital graph for some group and what groups are recognisable by their orbital graphs (or even just one orbital graph). We approach these problems from a theoretical point of view.
KeywordsOrbital graphs Backtrack search Permutation groups
- 1.Cameron, P.: Permutation Groups. London Mathematical Society Student Texts. Cambridge University Press, Cambridge (1999)Google Scholar
- 3.Jefferson, Chr., Pfeiffer, M., Waldecker, R.: New refiners for permutation group search. J. Symb. Comput. (2018). https://doi.org/10.1016/j.jsc.2017.12.003
- 4.Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science. Birkhäuser, Boston (1993)Google Scholar
- 5.Theißen, H.: Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen, Ph.D. thesis, RWTH Aachen (1997)Google Scholar