University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Computing normalisers of highly intransitive permutation groups

Computing normalisers of highly intransitive permutation groups

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact info@newton.ac.uk.

GRAW02 - Computational and algorithmic methods

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2020 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity