Computing normalisers of highly intransitive permutation groups
20 mins 18 secs,
37.14 MB,
MP3
44100 Hz,
249.78 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Chang, M
Thursday 30th January 2020 - 16:35 to 17:05 |
|---|
| Created: | 2020-01-30 16:59 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Chang, M |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | In general, there is no known polynomial-time algorithm for computing the normaliser NSn(H) of a given group H≤Sn. 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 NSn(H) can be computed in polynomial time. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 295.36 MB | View | Download | |
| WebM | 640x360 | 820.32 kbits/sec | 121.87 MB | View | Download | |
| iPod Video | 480x270 | 521.63 kbits/sec | 77.49 MB | View | Download | |
| MP3 * | 44100 Hz | 249.78 kbits/sec | 37.14 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||