Membership problems in braid groups and Artin groups
Robert D. Gray, Carl‐Fredrik Nyberg‐Brodda
Source abstract
Abstract We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the nonexistence of certain forbidden‐induced subgraphs of the defining graph. Furthermore, we also classify the Artin groups for which the following problems are decidable: the rational subset membership problem, semigroup intersection problem, and the fixed‐target submonoid membership problem. In the case of braid groups, our results show that the submonoid membership problem, and each and every one of these problems, is decidable in the braid group if and only if , which answers an open problem of Potapov (2013). Our results also generalize and extend results of Lohrey and Steinberg (2008) who classified right‐angled Artin groups with decidable submonoid (and rational subset) membership problem.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.