Oliver T. Dasbach, Bernd Gemein
Published 1998-09-12Version 1
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.
Comments: 18 pages, 4 figures
A Faithful Representation of the Singular Braid Monoid on Three Strands
On the singular braid monoid of an orientable surface
On Complexity of the Word Problem in Braid Groups and Mapping Class Groups
![QR code for arXiv:math/9809070 [math.GT]](http://oss.arxitics.com/images/favicon.svg)