BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:James Parkinson (University of Sydney)
DTSTART:20210809T080000Z
DTEND:20210809T090000Z
DTSTAMP:20260423T021407Z
UID:SiN/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SiN/28/">Aut
 omata for Coxeter groups</a>\nby James Parkinson (University of Sydney) as
  part of Symmetry in Newcastle\n\n\nAbstract\nIn 1993 Brink and Howlett pr
 oved that finitely generated Coxeter groups are automatic. In particular\,
  they constructed a finite state automaton recognising the language of red
 uced words in the Coxeter group. This automaton is constructed in terms of
  the remarkable set of "elementary roots" in the associated root system.\n
 In this talk we outline the construction of Brink and Howlett. We also des
 cribe the minimal automaton recognising the language of reduced words\, an
 d prove necessary and sufficient conditions for the Brink-Howlett automato
 n to coincide with this minimal automaton. This resolves a conjecture of H
 ohlweg\, Nadeau\, and Williams\, and is joint work with Yeeka Yau.\n
LOCATION:https://researchseminars.org/talk/SiN/28/
END:VEVENT
END:VCALENDAR