Automatic Structures for Torus Link Groups

From MaRDI portal



Abstract: A general result of Epstein and Thurston implies that all link groups are automatic, but the proof provides no explicit automaton. Here we show that the groups of all torus links are groups of fractions of so-called Garside monoids, i.e., roughly speaking, monoids with a good theory of divisibility, which allows us to reprove that those groups are automatic, but, in addition, gives a completely explicit description of the involved automata, thus partially answering a question of D.F.Holt.


Garside monoids are natural extensions of the positive braid monoids introduced by \textit{F. A. Garside} [Q. J. Math., Oxf. II. Ser. 20, 235-254 (1969; Zbl 0194.03303)]. A Garside group is the group of fractions of a Garside monoid. After providing a nice summary of results about biautomaticity of Garside groups from the work of \textit{P. Dehornoy} and \textit{L. Paris} [Ann. Sci. Éc. Norm. Supér., IV. Sér. 35, No. 2, 267-306 (2002; Zbl 1017.20031) and Proc. Lond. Math. Soc., III. Ser. 79, No. 3, 569-604 (1999; Zbl 1030.20021)], and several instructive examples, the author proves, with full details provided in the appendix, that all torus link groups are groups of fractions of Garside monoids. Consequently this method provides explicit biautomatic structures for each of these groups.











This page was built for publication: Automatic Structures for Torus Link Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474524)