相关论文: Reduce Problems From Braid Groups To Braid Monoids
We develop a new approach to the linear ordering of the braid group $B\_n$, based on investigating its restriction to the set $\Div(\Delta\_n^d)$ of all divisors of $\Delta\_n^d$ in the monoid $B\_\infty^+$, i.e., to positive $n$-braids…
Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the…
We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…
We construct two families of representations of the braid group $B_n$ by considering conjugation actions on congruence subgroups of $GL_{n-1}(Z[t^{\pm 1},q^{\pm 1}])$. We show that many of these representations are faithful modulo the…
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…
It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…
We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…
In the present paper, we construct a monomorphism from (Artin) pure braid group $PB_{n}$ into a group, which is `bigger' than $PB_{n}$. Roughly speaking, this mapping is defined on words of braids by adding `new generators' between…
The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…
In this paper we provide a solution to the double coset problem for the braid group $B_n$ modulo the Hilden subgroup $H_n.$ This result demonstrates that, as in the case of braid closures, the Link Problem for plat closures is "stably…
We present an algorithm for solving the conjugacy search problem in the four strand braid group. The computational complexity is cubic with respect to the braid length.
Long and Moody gave a method of constructing representations of the braid group B_n. We discuss some ways to generalize their construction. One of these gives representations of subgroups of B_n, including the Gassner representation of the…
We show that a certain linear representation of the singular braid monoid on three strands is faithful. Furthermore we will give a second - group theoretically motivated - solution to the word problem in this monoid.
We present an algorithmic approach to the conjugacy problems in monoids and semigroups, using rewriting systems. There is a class of monoids and semigroups that satisfy the condition that the transposi- tion problem and the left and right…
In this paper we investigate the decidability and complexity of problems related to braid composition. While all known problems for a class of braids with three strands, $B_3$, have polynomial time solutions we prove that a very natural…
We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…
We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…