skip to content
 

Computing normalisers of highly intransitive permutation groups

Presented by: 
Mun See Chang
Date: 
Thursday 30th January 2020 - 16:35 to 17:05
Venue: 
INI Seminar Room 1
Abstract: 
In general, there is no known polynomial-time algorithm for computing the normaliser $N_{S_n}(H)$ of a given group $H \leq S_n$. In this talk, we will consider the case when $H$ is a subdirect product of permutation isomorphic non-abelian simple groups. In contrast to the case with abelian simple groups, where only practical improvements have been made, here we show that $N_{S_n}(H)$ can be computed in polynomial time.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons