1 citations · 2 across the 10 of their papers we have counts for
3 papers · 1 filter
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…
Finite simple groups acting with fixity 3 and their occurrence as groups of automorphisms of Riemann surfaces (extended version)
Patrick Salfeld, Rebecca Waldecker
Motivated by the theory of Riemann surfaces, we classify all possibilities for finite simple groups acting faithfully on a compact Riemann surface of genus at least 2 in such a way…
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…