# Nikolaus conference 2017

Speaker: Mun See Chang (St Andrews)

Title: Computing Normalisers in Permutation Groups

Abstract:

The current state of the art algorithm for finding the normaliser $$N_G(H)$$ of a subgroup $$H$$ in a finite permutation group $$G$$ does not perform well when all orbits of $$H$$ have size at most 2. By considering these groups as vector spaces, the performance of the algorithm has been greatly improved. In this talk I will demonstrate some tests used in this algorithm to reduce the search size.