Membership problems in braid groups and Artin groups

DOI10.1112/JLMS.70326MaRDI QIDQ6897949zbMATH OpenFDO

Authors R. Gray, Carl-Fredrik Nyberg-Brodda

Publication date 19 November 2025

Published in Journal of the London Mathematical Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/JLMS.70326

zbMATH Keywords

Artin groupbraid groupmembership problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70)

Review text

The three fundamental decision problems posed by \textit{M. Dehn} [Math. Ann. 71, 116--144 (1912; JFM 42.0508.03)] are the word problem, the conjugacy problem and the isomorphism problem. The study of these problems stimulated the development of combinatorial methods in group theory, which led to the emergence of combinatorial group theory. Many problems in combinatorial group theory have arisen as generalizations of Dehn's problems. One such problem is submonoind membership problem. This problem asks if for a given group and its finitely generated submonoid there exists an algorithm that, given an element of the group (as a word over the generators), can decide whether that element belongs to the submonoid.\N\NArtin groups were introduced by \textit{E. Brieskorn} and \textit{K. Saito} [Invent. Math. 17, 245--271 (1972; Zbl 0243.20037)] and \textit{P. Deligne} [Invent. Math. 17, 273--302 (1972; Zbl 0238.20034)] as a generalization of the well-known braid groups. The authors of the paper under review study submonoid membership problem in finitely generated submonoids and more generally rational subsets, of Artin groups.\N\NThe main result of the paper classifies the Artin groups with decidable submonoid membership problem. Also the authors 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, these results show that the submonoid membership problem and each and every one of these problems, is decidable in the braid group \(B_{n}\) if and only if \(n\leq 3\).

Cites work

• GL(n, Z), Out(F_n) and everything in between: automorphism groups of RAAGs.
• A fast method for comparing braids
• A new algorithm for solving the word problem in braid groups
• A new approach to the word and conjugacy problems in the braid groups
• A note on words in braid monoids
• ALGORITHMS FOR POSITIVE BRAIDS
• An application of universal algebra in group theory
• An introduction to right-angled Artin groups.
• Artin groups of Euclidean type
• Artin groups of finite type are biautomatic
• Artin groups of large type are shortlex automatic with regular geodesics.
• Artin groups of type B and D
• Artin groups, rewriting systems and three-manifolds
• Artin monoids inject in their groups
• Artin-Gruppen und Coxeter-Gruppen
• Basic Questions on Artin-Tits groups
• Braid Groups
• Composition problems for braids
• Conjugacy in Artin groups of extra-large type.
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• Conjugacy in Garside groups. III: Periodic braids.
• Generalized Baumslag-Solitar groups: rank and finite index subgroups
• Geodesic automation and growth functions for Artin groups of finite type
• scientific article; zbMATH DE number 3138253 (Why is no real title available?)
• scientific article; zbMATH DE number 7221274 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• Large-type Artin groups are systolic
• Les immeubles des groupes de tresses généralises
• Membership problems in infinite groups
• Occurrence problem for braid groups \(B_{n+1}\) with \(n+1\geq 5\)
• On the isomorphism problem for even Artin groups
• On the rational subset problem for groups.
• ON THE SUBGROUP SEPARABILITY OF THE FUNDAMENTAL GROUP OF A FINITE GRAPH OF GROUPS
• On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
• Shortlex automaticity and geodesic regularity in Artin groups.
• Solving the conjugacy problem in Garside groups by cyclic sliding.
• Subgroup separability of Artin groups
• Subgroup separability, knot groups and graph manifolds
• Subgroups of the braid group \(B_ 4\)
• Surface subgroups of Coxeter and Artin groups.
• THE BRAID GROUP AND OTHER GROUPS
• THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS
• The conjugacy problem in subgroups of right-angled Artin groups
• The cyclic sliding operation in Garside groups.
• The mysterious geometry of Artin groups
• The rational subset membership problem for groups: a survey
• The solution to a conjecture of Tits on the subgroup generated by the squares of the generators of an Artin group
• The submonoid and rational subset membership problems for graph groups.
• Theory of braids
• Three-generator Artin groups of large type are biautomatic
• Tree groups and the 4-string pure braid group
• Twisted conjugacy in braid groups.
• Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups
• Über unendliche diskontinuierliche Gruppen.

Cited in

(2)

• The submonoid and rational subset membership problems for Artin groups
• Ordering groups and the identity problem

This page was built for publication: Membership problems in braid groups and Artin groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6897949)