Constructive recognition of matrix groups
46 mins 53 secs,
85.78 MB,
MP3
44100 Hz,
249.8 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Dietrich, H
Monday 27th January 2020 - 13:45 to 14:35 |
|---|
| Created: | 2020-01-27 15:46 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Dietrich, H |
| Language: | eng (English) |
| Distribution: |
World
(downloadable)
|
| Explicit content: | No |
| Aspect Ratio: | 16:9 |
| Screencast: | No |
| Bumper: | UCS Default |
| Trailer: | UCS Default |
| Abstract: | After decades of work by many people, the successes of Matrix Group Recognition Projects and their implementations in the CompositionTree package allow, for the first time, to compute efficiently with large matrix groups (defined over finite fields). A crucial ingredient in those algorithms is the constructive recognition of classical groups. I will survey some of those results and then comment in more detail on my work (with Eamonn O'Brien and Charles Leedham-Green) for finding standard generators in classical groups. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.93 Mbits/sec | 680.54 MB | View | Download | |
| WebM | 640x360 | 510.5 kbits/sec | 175.17 MB | View | Download | |
| iPod Video | 480x270 | 521.44 kbits/sec | 178.86 MB | View | Download | |
| MP3 * | 44100 Hz | 249.8 kbits/sec | 85.78 MB | Listen | Download | |
| Auto | (Allows browser to choose a format it supports) | |||||