Nikolaus Conference 2019

Speaker: Wilf Wilson (Halle)

Title: Exploring Graph Backtracking

Abstract:

I will discuss the results of my project with Chris Jefferson, Markus Pfeiffer, and Rebecca Waldecker, in which we use labelled digraphs to develop a generalisation of partition backtrack. This is a general algorithm that can solve a wide range of problems in finite symmetric groups, including coset intersection, normaliser, subgroup conjugacy, set stabiliser, and so on. I will talk about the principles involved, the state of our implementation, and our ideas for making the theory and the software as useful as possible.

Back to program