2000 character limit reached
The Word Problem is Solvable for 3-free Artin groups in Quadratic Time (2204.03523v4)
Published 7 Apr 2022 in math.GR
Abstract: We give a quadratic-time explicit and computable algorithm to solve the word problem for Artin groups that do not contain any relations of length 3. Furthermore, we prove that, given two geodesic words representing the same element, one can obtain one from the other by using a set of homogeneous relations that never increase the word length.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
