BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Finite permutation groups: applications to transfo
rmation semigroups and synchronization - Peter Cam
eron (University of St Andrews\; Queen Mary Univer
sity of London)
DTSTART;TZID=Europe/London:20200110T140000
DTEND;TZID=Europe/London:20200110T150000
UID:TALK136579AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/136579
DESCRIPTION:For the last 10 years\, I have been working with J
oã\;o Araú\;jo and others on exploring
how our new understanding of finite permutation g
roups 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 pion
eering work had been done by semigroup theorists a
ssuming that the transformation semigroup contains
the symmetric or alternating group\; but this ass
umption can be substantially weakened in many case
s. (The first such result was a classification of
the permutation groups G with the property that\,
for any non-permutation t\, the semigroup generate
d by G and t is (von Neumann) regular. I will ment
ion many open problems in this area.
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:INI IT
END:VEVENT
END:VCALENDAR