Computing with conjugacy classes in classical groups
50 mins 42 secs,
193.88 MB,
iPod Video
480x270,
30.0 fps,
44100 Hz,
522.1 kbits/sec
Share this media item:
Embed this media item:
Embed this media item:
About this item
Description: |
Liebeck, M
Friday 31st January 2020 - 14:45 to 15:35 |
---|
Created: | 2020-01-31 15:39 |
---|---|
Collection: | Groups, representations and applications: new perspectives |
Publisher: | Isaac Newton Institute |
Copyright: | Liebeck, M |
Language: | eng (English) |
Distribution: | World (downloadable) |
Explicit content: | No |
Aspect Ratio: | 16:9 |
Screencast: | No |
Bumper: | UCS Default |
Trailer: | UCS Default |
Abstract: | I will discuss some theory and algorithms for performing the following tasks with unipotent elements of finite classical groups: (1) writing down conjugacy class representatives (2) computing centralizers (3) solving the conjugacy problem, and finding conjugating elements. |
---|
Available Formats
Format | Quality | Bitrate | Size | |||
---|---|---|---|---|---|---|
MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 738.45 MB | View | Download | |
WebM | 640x360 | 729.39 kbits/sec | 270.94 MB | View | Download | |
iPod Video * | 480x270 | 522.1 kbits/sec | 193.88 MB | View | Download | |
MP3 | 44100 Hz | 249.78 kbits/sec | 92.85 MB | Listen | Download | |
Auto | (Allows browser to choose a format it supports) |