Classifying finite linear groups in prime degree
41 mins 10 secs,
108.74 MB,
WebM
640x360,
30.0 fps,
44100 Hz,
360.65 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Flannery, D
Thursday 30th January 2020 - 14:45 to 15:35 |
|---|
| Created: | 2020-01-30 15:59 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Flannery, D |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | We describe the complete, computational solution of an enduring problem in linear group theory. Specifically, we describe the classification of the finite irreducible monomial groups of prime degree (over the complex numbers). An exhaustive and self-contained solution of this problem has been obtained for all such solvable groups, and for all such groups of reasonably small degree (say, at most 23). We note obstacles that prevent a full solution of the problem for non-solvable groups in arbitrary prime degree. This is joint work with Zolt\'an B\'acskai and Eamonn O'Brien. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 597.72 MB | View | Download | |
| WebM * | 640x360 | 360.65 kbits/sec | 108.74 MB | View | Download | |
| iPod Video | 480x270 | 522.12 kbits/sec | 157.36 MB | View | Download | |
| MP3 | 44100 Hz | 249.74 kbits/sec | 75.36 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||