Pith. sign in

The Word Problem for the Singular Braid Monoid

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

citation-role summary

background 1

citation-polarity summary

fields

math.RT 1

years

2025 1

verdicts

REJECT 1

roles

background 1

polarities

background 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.