• Corpus ID: 229303366

Permutation group algorithms based on directed graphs (extended version).

@article{Jefferson2020PermutationGA,
  title={Permutation group algorithms based on directed graphs (extended version).},
  author={Christopher Jefferson and Markus Pfeiffer and Rebecca Waldecker and Wilf A. Wilson},
  journal={arXiv: Group Theory},
  year={2020}
}
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures. Our techniques generalise 'partition backtrack', which is the current state-of-the-art algorithm introduced by Jeffrey Leon in 1991, and which has inspired our work. Our backtrack search algorithms are organised around vertex- and arc-labelled directed… 
2 Citations

References

SHOWING 1-10 OF 16 REFERENCES
Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms
  • J. Leon
  • Computer Science, Mathematics
    J. Symb. Comput.
  • 1991
Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen
  • Ph.D. thesis, Lehrstuhl D für Mathematik, RWTH Aachen,
  • 1997
Partitions, refinements, and permutation group computation
  • J. Leon
  • Mathematics
    Groups and Computation
  • 1995
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
TLDR
Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed.
Practical graph isomorphism
  • II, J. Symbolic Comput
  • 2014
Permutation group algorithms based on directed graphs
Questions on Orbital Graphs
TLDR
This article considers 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, approaching these problems from a theoretical point of view.
Permutation Groups
Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms. .. You can expect to gain a deep insight into the constitution of Σ in this way. 1 Automorphism
Permutation Group Algorithms
TLDR
This paper presents an overview of black-box groups, a library of nearly linear time algorithms, and large-base groups, which are examples of permutation groups used for generating strong generating sets.
...
...