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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Computing normalisers of highly intransitive permutation groups

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Room W2.02, Judge Business School, Trumpington St., Cambridge Institution of Engineering and Technology Public Lectures Addenbrooke’s Seminar Room 8 (in the Clinical School)

Other talks

The concept of fitness in evolutionary biology: a philosophical analysis Talk TBC Title TBC A scientists guide to the art of radiation therapy and Neurosurgery for the oncologist Online Causal Inference Seminar Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study
 

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