Artin groups of extra-large type are biautomatic
From MaRDI portal
Publication:1916417
DOI10.1016/0022-4049(95)00094-1zbMath0872.20036OpenAlexW2013748069MaRDI QIDQ1916417
Publication date: 4 September 1996
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-4049(95)00094-1
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) Cancellation theory of groups; application of van Kampen diagrams (20F06)
Related Items
ON TWO CLASSES OF GROUPS SATISFYING THE STRONG BASS CONJECTURE, The Development of the Theory of Automatic Groups, An introduction to right-angled Artin groups., Time complexity of the conjugacy problem in relatively hyperbolic groups, Algorithms and topology of Cayley graphs for groups., Coronas for properly combable spaces, Combinatorial group theory and public key cryptography, THE TITS CONJECTURE FOR LOCALLY REDUCIBLE ARTIN GROUPS, ON BIAUTOMATICITY OF NON-HOMOGENOUS SMALL-CANCELLATION GROUPS, On Shephard groups with large triangles, Average-case complexity and decision problems in group theory., Relative hyperbolicity and Artin groups., On the Hochschild homology of \(\ell^1\)-rapid decay group algebras, Automatic Groups Associated with Word Orders Other than Shortlex, Helly meets Garside and Artin, Thick metric spaces, relative hyperbolicity, and quasi-isometric rigidity., Metric systolicity and two-dimensional Artin groups, Thickness of Feathers, Biautomatic structures in systolic Artin groups, Three-generator Artin groups of large type are biautomatic, The word problem for Artin groups of FC type, Artin groups, rewriting systems and three-manifolds, Conjugacy in Artin groups of extra-large type.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Small cancellation theory and automatic groups
- Artin groups and infinite Coxeter groups
- Small cancellation theory and automatic groups. II
- Artin groups of finite type are biautomatic
- Automatic groups and amalgams
- On Dehn's algorithm and the conjugacy problem
- The Complete Enumeration of Finite Groups of the Form Ri2=(RiRj)kij=1