2-dimensional Coxeter groups are biautomatic
Abstract
Let W be a 2-dimensional Coxeter group, that is, a one with 1mst+1msr+1mtr≤ 1 for all triples of distinct s,t,r∈ S. We prove that W is biautomatic. We do it by showing that a natural geodesic language is regular (for arbitrary W), and satisfies the fellow traveller property. As a consequence, by the work of Jacek \'Swiatkowski, groups acting properly and cocompactly on buildings of type W are also biautomatic. We also show that the fellow traveller property for the natural language fails for W=A3.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.