Related papers: Reduce Problems From Braid Groups To Braid Monoids
Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…
We give a complete classification of homomorphisms from the braid group on $n$ strands to the braid group on $2n$ strands when $n$ is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from…
The braid groups B_n can be defined as the mapping class group of the n-punctured disc. The Lawrence-Krammer representation of the braid group B_n is the induced action on a certain twisted second homology of the space of unordered pairs of…
We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…
We consider braids on $m+n$ strands, such that the first $m$ strands are trivially fixed. We denote the set of all such braids by $B_{m,n}$. Via concatenation $B_{m,n}$ acquires a group structure. The objective of this paper is to find a…
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…
We construct $(2n+1)\times (2n+1)$ matrices corresponding to a motion of points on the plane from the point of view of Delaunay triangulations. We define a homomorphism from the pure braid group on ($n+3$) strands to the general linear…
The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in…
We study braid diagrams with a minimal number of crossings. Such braid diagrams correspond to geodesic words for the braid groups with standard Artin generators. We prove that a diagram of a homogeneous braid is minimal if and only if it is…
We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…
We generalize the Brin-Higman-Thompson groups $n G_{k,1}$ to monoids $n M_{k,1}$, for $n \ge 1$ and $k \ge 2$, by replacing bijections by partial functions. The monoid $n M_{k,1}$ has $n G_{k,1}$ as its group of units, and is…
In this paper we solve moment problems for Poisson transforms and, more generally, for completely positive linear maps on unital C*-algebras generated by ''universal'' row contractions associated with the free semigroup with n generators.
We prove that for any finite Thurston-type ordering $<_{T}$ on the braid group\ $B_{n}$, the restriction to the positive braid monoid $(B_{n}^{+},<_{T})$ is a\ well-ordered set of order type $\omega^{\omega^{n-2}}$. The proof uses a combi\…
Given a representation $\varphi \colon B_n \to G_n$ of the braid group $B_n$, $n \geq 2$ into a group $G_n$, we are considering the problem of whether it is possible to extend this representation to a representation $\Phi \colon SM_n \to…
Positive permutation braids on n strings, which are defined to be positive n-braids where each pair of strings crosses at most once, form the elementary but non-trivial building blocks in many studies of conjugacy in the braid groups. We…
The reduced Burau representation $V_n$ of the braid group $B_n$ is obtained from the action of $B_n$ on the homology of an infinite cyclic cover of the $n$-punctured disc. In this note, we calculate $H_*(B_n;V_n)$ as a module over the…
This paper is a survey of some properties of the braid groups and related groups that lead to questions on mapping class groups.
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
We discuss a method for constructing multiplicative connections on proper Lie groupoids or, more exactly, for reducing the task of constructing such connections to a number of in principle simpler tasks involving only Lie groupoids that are…
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…