Finite permutation groups: applications to transformation semigroups and synchronization
Duration: 60 mins
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Cameron, P
Friday 10th January 2020 - 14:00 to 15:00 |
|---|
| Created: | 2020-01-14 09:01 |
|---|---|
| Collection: | Groups, representations and applications: new perspectives |
| Publisher: | Isaac Newton Institute |
| Copyright: | Cameron, P |
| Language: | eng (English) |
| Abstract: | For the last 10 years, I have been working with João Araújo and others on exploring how our new understanding of finite permutation groups can be used to advance the theory of finite transformation semigroups. In particular, I will talk about regularity and idempotent generation of semigroups, and synchronizing automata. The pioneering work had been done by semigroup theorists assuming that the transformation semigroup contains the symmetric or alternating group; but this assumption can be substantially weakened in many cases. (The first such result was a classification of the permutation groups G with the property that, for any non-permutation t, the semigroup generated by G and t is (von Neumann) regular. I will mention many open problems in this area. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.81 Mbits/sec | 814.83 MB | View | Download | |
| WebM | 640x360 | 326.15 kbits/sec | 143.33 MB | View | Download | |
| iPod Video | 480x270 | 523.34 kbits/sec | 229.99 MB | View | Download | |
| MP3 | 44100 Hz | 250.78 kbits/sec | 110.21 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||