Coxeter groups were famously proven to be automatic by 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 history and summary of recent developments in this area, and we introduce the theory of Regular Partitions of Coxeter groups. We show that Regular Partitions are essentially equivalent to the class of automata (not necessarily finite state) recognising the language of reduced words in the Coxeter group and explain how it gives a fundamentally free construction of automata. As a further application, we prove that each cone type in a Coxeter group has a unique minimal length representative. This result can be seen as an analogue of Shi’s classical result that each component of the Shi arrangement of an affine Coxeter group has a unique minimal length element. (Joint work with James Parkinson)

Speaker’s webpage: https://www.maths.usyd.edu.au/u/yyau/

Zoom link: Jointly in person and virtually on Zoom. SAS 4201 for in-person participation. The Zoom link is sent out to the Algebra and Combinatorics mailing list, please contact Corey Jones at cmjones6@ncsu.edu to be added.