Computing normalisers of highly intransitive permutation groups

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

• Mun See Chang (University of St Andrews)
• Thursday 30 January 2020, 16:35-17:05
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

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.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.