2-dimensional Coxeter groups are biautomatic
Zachary Munro, Damian Osajda, and Piotr Przytycki

TL;DR
This paper proves that 2-dimensional Coxeter groups are biautomatic by demonstrating the regularity of a natural geodesic language and its fellow traveller property, with implications for groups acting on certain buildings.
Contribution
It establishes biautomaticity for 2-dimensional Coxeter groups using geodesic language regularity and fellow traveller property, extending to groups acting on buildings of this type.
Findings
Natural geodesic language is regular for all 2D Coxeter groups.
The geodesic language satisfies the fellow traveller property.
Fellow traveller property fails for tilde;A_3.
Abstract
Let be a -dimensional Coxeter group, that is, a one with for all triples of distinct . We prove that is biautomatic. We do it by showing that a natural geodesic language is regular (for arbitrary ), and satisfies the fellow traveller property. As a consequence, by the work of Jacek \'{S}wi\k{a}tkowski, groups acting properly and cocompactly on buildings of type are also biautomatic. We also show that the fellow traveller property for the natural language fails for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
