Date: Thu, Nov 16, 2017
Time: 16:10 - 17:10
Venue: Middle Meeting Room
Title: Permutation groups and transformation semigroups (II)
A permutation group is called synchronizing if the semigroup generated by the group together with any non-permutation of the domain contains an element of rank 1 (that is, whose image consists of a single point). This concept arose in automata theory. The definition can be translated to one involving graph endomorphisms. I will outline what is known about synchronizing groups.
Slides: View slides