BIRS Workshop Lecture Videos

Banff International Research Station Logo

BIRS Workshop Lecture Videos

Normalisers of primitive permutation groups Roney Dougal, Colva


We present a new approach to computing the normaliser of a primitive group G in an arbitrary subgroup H of S_n. Our method runs in quasipolynomial time O(2^{\log^3 n}), whereas the previous best known algorithm was simply exponential. The main tools used are Babaiâ s recent breakthrough on the graph isomorphism problem, and results on the base size, the order, and the minimal number of generators of a primitive group.

Item Media

Item Citations and Data


Attribution-NonCommercial-NoDerivatives 4.0 International