Membership problems in braid groups and Artin groups

Gray, Robert D. and Nyberg-Brodda, Carl Fredrik (2025) Membership problems in braid groups and Artin groups. Journal of the London Mathematical Society. ISSN 0024-6107 (In Press)

[thumbnail of BobCFArtinJLMSFinalVersion29September2025] PDF (BobCFArtinJLMSFinalVersion29September2025) - Accepted Version
Restricted to Repository staff only until 31 December 2099.

Request a copy

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 non-existence 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 Bn if and only if n ≤ 3, which answers an open problem of Potapov (2013). Our results also generalize and extend results of Lohrey & Steinberg (2008) who classified right-angled Artin groups with decidable submonoid (and rational subset) membership problem.

Item Type: Article
Faculty \ School: Faculty of Science > School of Engineering, Mathematics and Physics
UEA Research Groups: Faculty of Science > Research Groups > Algebra, Number Theory, Logic, and Representations (ANTLR)
Depositing User: LivePure Connector
Date Deposited: 29 Sep 2025 11:30
Last Modified: 29 Sep 2025 11:30
URI: https://ueaeprints.uea.ac.uk/id/eprint/100506
DOI: issn:0024-6107

Actions (login required)

View Item View Item