Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 18 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Artin groups of type (2,3,n) (2310.14632v2)

Published 23 Oct 2023 in math.GR

Abstract: Our main theorem is that the word problem in the Artin group G = <a,b,c | aba=bab, ac=ca, {}_{n}(b,c) = {}_{n}(c,b) > for n >= 5 can be solved using a system R of length preserving rewrite rules that, together with free reduction, can be used to reduce any word over {a,b,c} to a geodesic word in $G$, in quadratic time. This result builds on work of Holt and Rees, and of Blasco, Cumplido and Morris-Wright, which proves the same result for all Artin groups that are either sufficiently large or 3-free. Since every rank 3 Artin group is either spherical or in one of the categories covered by the previous results on which we build, it follows that any rank 3 Artin group has quadratic Dehn function. However we note that this and much more is a consequence of very recent work of Haettel and Huang; our contribution is to provide a particular kind or rewriting solution to the word problem for the non-spherical rank 3 Artin groups (and more).

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.