Related papers: The Word Problem for the Singular Braid Monoid
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 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…
The surface singular braid monoid corresponds to marked graph diagrams of knotted surfaces in braid form. In a quest to resolve linearity problem for this monoid, we will show that if it is defined on at least two or at least three strands,…
We exhibit explicit and easily realisable bijections between Hecke--Kiselman monoids of type $A_n$/$\widetilde{A}_n$; certain braid diagrams on the plane/cylinder; and couples of integer sequences of particular types. This yields a fast…
We introduce braid monodromy for the discriminant hypersurface in versal unfoldings of hypersurface singularities. Our objective is then to compute this invariant for singularities of Brieskorn Pham type: First we consider the unfolding by…
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…
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids $u,v\in B_n$ and an automorphism $\phi \in Aut (B_n)$, decides whether $v=(\phi (x))^{-1}ux$ for some $x\in B_n$. As…
We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…
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.…
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.
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 consider blind, deterministic, finite automata equipped with a register which stores an element of a given monoid, and which is modified by right multiplication by monoid elements. We show that, for monoids M drawn from a large class…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
We prove that the word problem in the mapping class group of the once-punctured surface of genus g has complexity O(|w|^2 g for |w| > log(g) where |w| is the length of the word in a (standard) set of generators. The corresponding bound in…
For a natural number $n$, denote by $B_n$ the braid group on $n$ strings and by $SM_n$ the singular braid monoid on $n$ strings. $SM_n$ is one of the most important extensions of $B_n$. In [13], Y. Mikhalchishina classified all homogeneous…
In this paper, we shall introduce two monoids. One is called a PM-monoid which contains the symmetric group, the other is called a braid PM-monoid which contains the braid group. We shall develop the theory of PM-monoids and that of braid…
We study the algebraic structures of the virtual singular braid monoid, $VSB_n$, and the virtual singular pure braid monoid, $VSP_n$. The monoid $VSB_n$ is the splittable extension of $VSP_n$ by the symmetric group $S_n$. We also construct…
The computational complexity of the word problem in HNN-extension of groups is studied. HNN-extension is a fundamental construction in combinatorial group theory. It is shown that the word problem for an ascending HNN-extension of a group H…
We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…
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…