BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251121T173640EST-8939l7ZzCu@132.216.98.100
DTSTAMP:20251121T223640Z
DESCRIPTION:Title: Cone Types\, Automata and Regular Partitions of Coxeter 
 Groups.\n\nAbstract: Coxeter groups were famously proven to be automatic b
 y Brink and Howlett in 1993 and the automaticity of these groups has been 
 an area of continued interest since. In this talk\, we give a brief histor
 y and summary of recent developments in this area\, and we introduce the t
 heory of regular partitions of Coxeter groups. We show that regular partit
 ions are essentially equivalent to the class of automata (not necessarily 
 finite state) recognising the language of reduced words in the Coxeter gro
 up and explain how it gives a fundamentally free construction of automata.
  As a further application\, we prove that each cone type in a Coxeter grou
 p has a unique minimal length representative. This result can be seen as a
 n analogue of Shi’s classical result that each component of the Shi arrang
 ement of an affine Coxeter group has a unique minimal length element. (Joi
 nt work with James Parkinson)\n
DTSTART:20220429T150000Z
DTEND:20220429T160000Z
LOCATION:Room PK-4323\, CA\, H2X 3Y7\, 201 Ave. du President-Kennedy
SUMMARY:Yeeka Yau (University of Sydney)
URL:/mathstat/channels/event/yeeka-yau-university-sydn
 ey-339277
END:VEVENT
END:VCALENDAR