skip to content
 

Finite permutation groups: applications to transformation semigroups and synchronization

Presented by: 
Peter Cameron University of St Andrews, Queen Mary University of London
Date: 
Friday 10th January 2020 - 14:00 to 15:00
Venue: 
INI Seminar Room 1
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.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons