2-dimensional Coxeter groups are biautomatic
Group Theory
2021-07-01 v2
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 .
Keywords
Cite
@article{arxiv.2006.07947,
title = {2-dimensional Coxeter groups are biautomatic},
author = {Zachary Munro and Damian Osajda and Piotr Przytycki},
journal= {arXiv preprint arXiv:2006.07947},
year = {2021}
}
Comments
18 pages, 13 figures