The Word Problem for the Singular Braid Monoid
From MaRDI portal
Publication:6501016
arXivmath/9809070MaRDI QIDQ6501016FDOQ6501016
Authors: Oliver T. Dasbach, Bernd Gemein 
Abstract: We give a solution to the word problem for the singular braid monoid SB_n. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically reprove a result of Fenn, Keyman and Rourke that the monoid embeds into a group and we compute the cohomological dimension of this group.
Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
This page was built for publication: The Word Problem for the Singular Braid Monoid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6501016)
