Loading Events

Department of Mathematics Calendar

Yeeka Yau, University of Sydney, Coxeter systems for which the Brink-Howlett automaton is minimal

  • This event has passed.
February 18 | 3:00 pm - 4:00 pm EST

Event Navigation

In their celebrated 1993 paper, Brink and Howlett proved that all finitely generated Coxeter groups are automatic. In particular, they constructed a finite state automaton recognising the language of reduced words in a Coxeter group. This automaton is not minimal in general, and recently Christophe Hohlweg, Philippe Nadeau and Nathan Williams stated a conjectural criteria for the minimality. In this talk we will explain these concepts, and prove the conjecture of Hohlweg, Nadeau, and Williams. This work is joint with James Parkinson.



February 18

3:00 pm - 4:00 pm
Event Category:
SAS 4201