Computational methods for exceptional groups
46 mins 40 secs,
677.91 MB,
MPEG-4 Video
640x360,
30.0 fps,
44100 Hz,
1.93 Mbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Thomas, A
Wednesday 29th January 2020 - 09:10 to 10:00 |
|---|
| Created: | 2020-01-29 11:23 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Thomas, A |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | This talk will contain no new algorithms or methods for computation in groups. Instead, I will describe my (ab)using of existing algorithms (in Magma) to help study the structure of exceptional algebraic groups, their Lie algebras and the exceptional finite groups of Lie type. Such computational methods have guided me and often formed part of the argument in lots of my work, including joint projects with Tim Burness, Alastair Litterick and David Stewart. These applications have included representation theory, especially calculating cohomology groups, intersection of subgroups and construction of subgroups. The talk will include many open-ended (and impossible-to-answer) questions about the finite groups of Lie type machinery and related algorithms, which will hopefully be helpful to other users in the audience. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video * | 640x360 | 1.93 Mbits/sec | 677.91 MB | View | Download | |
| WebM | 640x360 | 298.99 kbits/sec | 102.23 MB | View | Download | |
| iPod Video | 480x270 | 522.18 kbits/sec | 178.48 MB | View | Download | |
| MP3 | 44100 Hz | 249.78 kbits/sec | 85.47 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||