Rewriting systems in sufficiently large Artin-Tits groups.

DOI10.1016/j.jalgebra.2016.07.031zbMath1351.20018arXiv1511.02789OpenAlexW2962997315MaRDI QIDQ308128

Eddy Godelle, Sarah Rees

Publication date: 5 September 2016

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.02789

zbMATH Keywords

presentationsword problemrewriting systemslarge type Artin-Tits groups

Mathematics Subject Classification ID

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

Related Items

Multifraction reduction. IV: Padding and Artin-Tits monoids of sufficiently large type

Cites Work

• Artin groups and infinite Coxeter groups
• Parabolic subgroups of Artin groups
• Three-generator Artin groups of large type are biautomatic
• Automorphisms of graph groups.
• Parabolic subgroups of Artin groups of type FC.
• A conjecture about Artin-Tits groups.
• Shortlex automaticity and geodesic regularity in Artin groups
• Artin groups of large type are shortlex automatic with regular geodesics
• Convexity of parabolic subgroups in Artin groups
• THE SUBWORD REVERSING METHOD
• GROWTH SERIES FOR ARTIN GROUPS OF DIHEDRAL TYPE
• Unnamed Item
• Unnamed Item