Coxeter Groups are Biautomatic - Workshop on Cube Complexes and Combinatorial Geometry
Centre de recherches mathématiques - CRM via YouTube
Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
Build AI Apps with Azure, Copilot, and Generative AI — Microsoft Certified
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore a groundbreaking proof of biautomaticity for all Coxeter groups in this one-hour lecture from the Workshop on Cube Complexes and Combinatorial Geometry. Delve into the construction of biautomatic structures and discover how this leads to the biautomaticity of uniform lattices in isometry groups of buildings. Learn about the collaborative research conducted by Damian Osajda and Piotr Przytycki, which forms the foundation of this presentation at the Centre de recherches mathématiques (CRM).
Syllabus
Damian Osajda: Coxeter groups are biautomatic.
Taught by
Centre de recherches mathématiques - CRM