# On the inverse braid monoid

**Authors:** Vladimir V. Vershinin

arXiv: 0704.3002 · 2012-02-20

## TL;DR

This paper explores the inverse braid monoid, extending properties of braid groups to it, and provides solutions to the word problem along with new presentations and structural insights.

## Contribution

It introduces the inverse braid monoid, extends braid group properties to it, and offers solutions to the word problem using new algebraic approaches.

## Key findings

- Extended properties of braid groups to inverse braid monoids
- Provided solutions to the word problem for inverse braid monoids
- Developed analogues of Artin and Sergiescu presentations

## Abstract

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial $n$ may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to the inverse braid monoids. Namely we prove an inclusion into a monoid of partial monomorphisms of a free group. This gives a solution of the word problem. Another solution is obtained by an approach similar to that of Garside. We give also the analogues of Artin presentation with two generators and Sergiescu graph-presentations.

## Full text

Tomesphere does not host the full text of arXiv papers. Read it on arXiv: https://arxiv.org/abs/0704.3002

## References

41 references — full list in the complete paper: https://tomesphere.com/paper/0704.3002/full.md

---
Source: https://tomesphere.com/paper/0704.3002