Related papers: On the inverse braid monoid

A new presentation of the $n$-string braid group $B_n$ is studied. Using it, a new solution to the word problem in $B_n$ is obtained which retains most of the desirable features of the Garside-Thurston solution, and at the same time makes…

We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case,…

We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…

The dual symmetric inverse monoid $\mathscr{I}_n^*$ is the inverse monoid of all isomorphisms between quotients of an $n$-set. We give a monoid presentation of $\mathscr{I}_n^*$ and, along the way, establish criteria for a monoid to be…

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.

The Kontsevich integral $Z$ associates to each braid $b$ (or more generally knot $k$) invariants $Z_i(b)$ lying in finite dimensional vector spaces, for $i = 0, 1, 2, ...$. These values are not yet known, except in special cases. The…

The braid group $B_{n}$, endowed with Artin's presentation, admits an antiautomorphism $B_{n} \to B_{n}$, such that $v \mapsto \bar{v}$ is defined by reading braids in reverse order (from right to left instead of left to right). We prove…

The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that…

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…

The braid group $B_{n}$, endowed with Artin's presentation, admits two distinguished involutions. One is the anti-automorphism ${\rm{rev}}: B_{n} \to B_{n}$, $v \mapsto \bar{v}$, defined by reading braids in the reverse order (from right to…

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first…

Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic…

We prove that the class of finitely presented inverse monoids whose Sch\"utzenberger graphs are quasi-isometric to trees has a uniformly solvable word problem, furthermore, the languages of their Sch\"utzenberger automata are context-free.…

We associate to every positive braid a braid monodromy group, generalizing the geometric monodromy group of an isolated plane curve singularity. If the closure of the braid is a knot, we identify the corresponding group with a framed…

We summarize the main known results involving subword reversing, a method of semigroup theory for constructing van Kampen diagrams by referring to a preferred direction. In good cases, the method provides a powerful tool for investigating…

This paper considers the word problem for free inverse monoids of finite rank from a language theory perspective. It is shown that no free inverse monoid has context-free word problem; that the word problem of the free inverse monoid of…

Gr\"obner bases, in their noncommutative version, and word reversing are methods for solving the word problem of a presented monoid, and both rely on iteratively completing the initial list of relations. Simple examples may suggest to…

Garside calculus is the common mechanism that underlies a certain type of normal form for the elements of a monoid, a group, or a category. Originating from Garside's approach to Artin's braid groups, it has been extended to more and more…