2-dimensional Coxeter groups are biautomatic
arXiv:2006.07947 · doi:10.1017/prm.2021.11
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 Świą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 .
18 pages, 13 figures