1 citations · 2 across the 10 of their papers we have counts for
13 papers
Finite simple groups acting with fixity 4 and their occurrence as groups of automorphisms of Riemann surfaces (extended version)
Patrick Salfeld, Rebecca Waldecker
In previous work, all finite simple groups that act with fixity 4 have been classified. In this article we investigate which ones of these groups act faithfully on a compact Rieman…
-free groups
Imke Toborg, Rebecca Waldecker, Clemens B. Tietze
In this article we classify all -free finite groups.
Computing canonical images in permutation groups with Graph Backtracking
Christopher Jefferson, Rebecca Waldecker, Wilf A. Wilson
We describe a new algorithm for finding a canonical image of an object under the action of a finite permutation group. This algorithm builds on previous work using Graph Backtracki…
Finite simple permutation groups acting with fixity 4
Barbara Baumeister, Paula Hähndel, Kay Magaard +2
Motivated by the theory of Riemann surfaces and specifically the significance of Weierstrass points, we classify all finite simple groups that have a faithful transitive action wit…
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…
Permutation group algorithms based on directed graphs (extended version)
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…
Orbital Graphs
Paula Hähndel, Christopher Jefferson, Markus Pfeiffer +1
We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the inters…
Minimal and Canonical Images
Christopher Jefferson, Eliza Jonauskyte, Markus Pfeiffer +1
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit…
New refiners for permutation group search
Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker
We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems. First we…
Transitive permutation groups with trivial four point stabilizers
Kay Magaard, Rebecca Waldecker
In this paper we analyze the structure of transitive permutation groups that have trivial four point stabilizers, but some nontrivial three point stabilizer. In particular we give…
A note on groups in which the centraliser of every element of order 5 is a 5-group
Sarah Astill, Chris Parker, Rebecca Waldecker
The main theorem in this article shows that a group of odd order which admits the alternating group of degree 5 with an element of order 5 acting fixed point freely is nilpotent of…