Automatic structures for torus link groups
Matthieu Picantin
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.
Create a lesson
Related papers
The variety generated by all additively idempotent semirings of order four
Mengya Yue, Xiaolei Shao
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
Jiaping Lu
Kernel--wreath constructions and infinite families of finite simple skew braces
Marco Damele
Explicit equational bases for the power semirings of S7
Mengya Yue, Miaomiao Ren, Zidong Gao
The free multiplicative Lie algebra L(P) for a finitely generated parafree group P
Dessislava H. Kochloukova
An order automorphism of a Dlab group not induced by conjugation
Ting Gong, Yong Yang, Michael Ruofan Zeng