Finite permutation groups: the landscape post-CFSG
Duration: 60 mins
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Cameron, P
Thursday 9th January 2020 - 15:00 to 16:00 |
|---|
| Created: | 2020-01-14 08:51 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Cameron, P |
| Language: | eng (English) |
| Abstract: | In the 40 years since the Classification of Finite Simple Groups was first (tentatively) announced, our understanding of finite permutation groups has been radically transformed: previously untouchable classical problems have been solved, many new classifications produced, and applications to a wide area of mathematics, from number theory to computer science, have been developed. In this lecture I will outline the theory of finite permutation groups and explain how, using the O'Nan--Scott Theorem, CFSG can be brought to bear on various questions. In some cases, proofs avoiding CFSG have subsequently been found; but there are some interesting challenges where this has not so far proved possible. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.96 Mbits/sec | 886.10 MB | View | Download | |
| WebM | 640x360 | 328.71 kbits/sec | 144.46 MB | View | Download | |
| iPod Video | 480x270 | 530.18 kbits/sec | 232.99 MB | View | Download | |
| MP3 | 44100 Hz | 249.84 kbits/sec | 111.63 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||