The Word Problem for the Singular Braid Monoid
Oliver T. Dasbach, Bernd Gemein
Abstract
We give a solution to the word problem for the singular braid monoid SBn. 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.
Create a lesson
Related papers
Combinatorial Goussarov-Polyak-Viro Formulas for the Linking Number and Low Degree Coefficients of the Conway Polynomial
Nancy Scherich, Nathaniel Song
The flip symmetry on Khovanov-Rozansky homology
Hongjian Yang
Families of knots that cannot be made Legendrian parametrically
Javier Martínez-Aguinaga
Branched real projective structures on surfaces and geometrisation of representations
Gianluca Faraco, Nicholas Rungi
Generating the twist subgroup of the level 2 mapping class group of a non-orientable closed surface
Ryoma Kobayashi
H-cobordisms, infinite cyclic covers, and real Seiberg--Witten theory
Sungkyung Kang, JungHwan Park, Masaki Taniguchi