New refiners for permutation group search

Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
2 Downloads (Pure)

Abstract

Partition backtrack is the current generic state of the art algorithm to search for subgroups of a given permutation group. We describe an improvement of partition backtrack for set stabilizers and intersections of subgroups by using orbital graphs. With extensive experiments we demonstrate that our methods improve performance of partition backtrack – in some cases by several orders of magnitude.
Original languageEnglish
Pages (from-to)70-92
Number of pages23
JournalJournal of Symbolic Computation
Volume92
Early online date11 Jan 2018
DOIs
Publication statusPublished - May 2019

Keywords

  • Backtrack search
  • Refiners
  • Permutation groups
  • Algorithmic group theory
  • Computational algebra
  • Partition backtrack

Fingerprint

Dive into the research topics of 'New refiners for permutation group search'. Together they form a unique fingerprint.

Cite this