Artin groups of large type are shortlex automatic with regular geodesics

Abstract

We prove that any Artin group of large type is shortlex automatic with respect to its standard generating set, and that the set of all geodesic words over the same generating set satisfies the Falsification by Fellow-Traveller Property (FFTP) and hence is regular.

40 pages, 5 figures

References in corpus (1)

• Automatic structures, rational growth and geometrically finite hyperbolic groups

Cited by in corpus (13)

• Finite Gröbner--Shirshov bases for Plactic algebras and biautomatic structures for Plactic monoids
• Large-type Artin groups are systolic
• Convexity of parabolic subgroups in Artin groups
• Finite generating sets of relatively hyperbolic groups and applications to geodesic languages
• Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types $A_n$, $B_n$, $C_n$, $D_n$, and $G_2$
• Approximation properties in Lipschitz-free spaces over groups
• Quasi-Euclidean tilings over 2-dimensional Artin groups and their applications
• Multifraction reduction IV: Padding and Artin-Tits groups of sufficiently large type
• Poly-freeness of large even Artin groups
• Rapid decay and Baum-Connes for large type Artin groups
• Counting subgraphs in fftp graphs with symmetry
• Conjugacy languages in groups
• Piecewise excluding geodesic languages