Related papers: A simple solution to the word problem for virtual …
The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a topological…
We study the structure of the virtual braid group. It is shown that the virtual braid group is a semi--direct product of the virtual pure braid group and the symmetric group. Also, it is shown that the virtual pure braid group is a…
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…
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 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 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…
The virtual braid groups are generalizations of the classical braid groups. This paper gives an elementary proof that the classical braid group injects into the virtual braid group over the same number of strands.
For $n \geq 2$ we describe an $O(l^3n)$-time algorithm that determines if a length $l$ virtual braid word in the standard presentation of the virtual braid group ${\mathcal VB}_n$ represents the trivial virtual braid.
This paper proposes for every $n$, linear time reductions of the word and conjugacy problems on the braid groups $B_n$ to the corresponding problems on the braid monoids $B_n^+$ and moreover only using positive words representations.
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.
We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…
We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…
This paper gives a new interpretation of the virtual braid group in terms of a strict monoidal category SC that is freely generated by one object and three morphisms, two of the morphisms corresponding to basic pure virtual braids and one…
We show that the virtual singular braid monoid on $n$ strands embeds in a group $VSG_n$, which we call the virtual singular braid group on $n$ strands. The group $VSG_n$ contains a normal subgroup $VSPG_n$ of virtual singular pure braids.…
We begin by establishing two fundamental results on standard parabolic subgroups of virtual Artin groups. We first show that a standard parabolic subgroup is naturally isomorphic to a virtual Artin group. Second, we prove that the…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
We give a general procedure that provides, given any particular pretzel link, a braid whose closure is the pretzel link. Moreover, we manage to give a specific braid word in terms of the entries of the pretzel link.
We show that the word problem for braided monoidal categories is at least as hard as the unknotting problem. As a corollary, so is the word problem for Gray categories. We conjecture that the word problem for Gray categories is decidable.
In the paper, we introduce the notion of a (virtual) multi-switch which generalizes the notion of a (virtual) switch. Using (virtual) multi-switches we introduce a general approach on how to construct representations of (virtual) braid…