Shortlex automaticity and geodesic regularity in Artin groups

DOI10.1515/gcc-2013-0001zbMath1284.20036OpenAlexW1981020857MaRDI QIDQ2873315

Derek F. Holt, Sarah Rees

Publication date: 23 January 2014

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2013-0001

zbMATH Keywords

presentationsArtin groupsgenerating setsautomatic groupsgeodesic words

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (10)

Algorithmic problems in right-angled Artin groups: complexity and applications ⋮ Rewriting systems in sufficiently large Artin-Tits groups. ⋮ The Development of the Theory of Automatic Groups ⋮ Intrinsic tame filling functions are equivalent to intrinsic diameter functions ⋮ A Cayley graph for F2 × F2 which is not minimally almost convex ⋮ Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type ⋮ Convexity of parabolic subgroups in Artin groups ⋮ Poly-freeness in large even Artin groups ⋮ Automaticity for graphs of groups ⋮ Biautomatic structures in systolic Artin groups

This page was built for publication: Shortlex automaticity and geodesic regularity in Artin groups