BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Computing normalisers of highly intransitive permutation groups - 
 Mun See Chang (University of St Andrews)
DTSTART:20200130T163500Z
DTEND:20200130T170500Z
UID:TALK138193@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:In general\, there is no known polynomial-time algorithm for c
 omputing the normaliser $N_{S_n}(H)$ of a given group $H \\leq S_n$. In th
 is talk\, we will consider the case when $H$ is a subdirect product of per
 mutation isomorphic non-abelian simple groups. In contrast to the case wit
 h abelian simple groups\, where only practical improvements have been made
 \, here we show that $N_{S_n}(H)$ can be computed in polynomial time.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR