BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:The group of asynchronus rational automata is simple but not finit
 ely generated
DTSTART:20181004T150000
DTEND:20181004T160000
DTSTAMP:20260502T031551Z
UID:ef158d8692317ea5f0b1a271d101f3f38fc76dfbddb68fe04566ec1a
CATEGORIES:Conferences - Seminars
DESCRIPTION:James Hyde\, St. Andrews\n\nThe group R of asynchronus rationa
 l automata was introduced by Grigorchuk\, Nekrashevych\, and Sushchanskii 
 in 2000. Jim Belk\, Francesco Matucci and myself show in a joint paper tha
 t R is simple but not finitely generated. I will define R and sketch the p
 roofs of these two results.
LOCATION:MA A1 10 https://plan.epfl.ch/?room=MAA110
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR