2 citations · 3 across the 5 of their papers we have counts for
3 papers · 2 filters
Perfect refiners for permutation group backtracking algorithms
Christopher Jefferson, Rebecca Waldecker, Wilf A. Wilson
Backtrack search is a fundamental technique for computing with finite permutation groups, which has been formulated in terms of points, ordered partitions, and graphs. We provide a…
Computing normalisers of intransitive groups
Mun See Chang, Christopher Jefferson, Colva M. Roney-Dougal
The normaliser problem takes as input subgroups and of the symmetric group , and asks one to compute . The fastest known algorithm for this problem is simply e…
Permutation group algorithms based on directed graphs
Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker +1
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections…