Related papers: A simple solution to the word problem for virtual …
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
The virtual singular braid group arises as a natural common generalization of classical singular braid groups and virtual braid groups. In this paper, we study several algebraic properties of the virtual singular braid group $VSG_n$. We…
We show that the word problem for any 3-manifold group is solvable in time $O(n\log^3 n)$. Our main contribution is the proof that the word problem for admissible graphs of groups, in the sense of Croke and Kleiner, is solvable in $O(n\log…
In this article we provide a new perspective on the word problem of a group by using languages of nested words. These were introduced by Alur and Madhusudan as a way to model programming languages such as HTML. We demonstrate how a class of…
We use the classical interpretation of the braid group $B_3$ as a central extension of the modular group $\text{PSL}_2\left(\mathbb{Z}\right)$ to establish new and fundamental properties of $B_3$ using the theory of continued fractions. In…
In the present paper the representation of the virtual braid group $VB_n$ into the automorphism group of free product of the free group and free abelian group is constructed. This representation generalizes the previously constructed ones.…
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…
We give a simple naming argument for establishing lower bounds on the combinatorial distance between (positive) braid words.
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
In the last decade, a number of public key cryptosystems based on com- binatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts…
We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside groups (which include…
L. Kauffman (2024) introduced multi-virtual and symmetric multi-virtual braid groups, which are generalizations of the virtual braid group. We introduce multi-virtual pure and multi-virtual semi-pure braid groups, which are normal subgroups…
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility,…
The aim of the present note is to construct invariants of the Artin braid group valued in $G_{N}^{2}$, and further study of groups related to $G_{n}^{3}$. In the groups $G_{n}^{2}$, the word problem is solved; these groups are much simpler…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
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 found Groebner-Shirshov basis for the braid semigroup $B^+_{n+1}$. It gives a new algorithm for the solution of the word problem for the braid semigroup and so for the braid group.
The word problem for discrete groups is well-known to be undecidable by a Turing Machine; more precisely, it is reducible both to and from and thus equivalent to the discrete Halting Problem. The present work introduces and studies a real…
This article is dedicate to cabling on virtual braids. This construction gives a new generating set for the virtual pure braid group $VP_n$. Consequently we describe $VP_4$ as HNN-extension. As an application to classical braids, we find a…
We give presentations of braid groups and pure braid groups on surfaces.