Abstract
The inverse braid monoid [ ] consists of n-string braids from which some subset of the strings has been deleted. Such partial braids may be composed by concatenation followed by the deletion of any incomplete strings, and this operation gives [ ] the structure of an inverse monoid. We derive presentations of [ ] by first using a groupoid presentation, and then deriving equivalent inverse monoid presentations. In particular, we offer a new derivation of the presentation for [ ] that has been given by Easdown and Lavers.

This publication has 7 references indexed in Scilit: