Related papers: Reduce Problems From Braid Groups To Braid Monoids

We study the representations of the commutator subgroup K_{n} of the braid group B_{n} into a finite group . This is done through a symbolic dynamical system. Some experimental results enable us to compute the number of subgroups of K_{n}…

Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…

The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…

In a previous work [11], the author considered a representation of the braid group \rho: B_n\to GL_m(\Bbb Z[q^{\pm 1},t^{\pm 1}]) (m=n(n-1)/2), and proved it to be faithful for n=4. Bigelow [3] then proved the same representation to be…

We give a quadratic-time explicit and computable algorithm to solve the word problem for Artin groups that do not contain any relations of length 3. Furthermore, we prove that, given two geodesic words representing the same element, one can…

We characterize the double centralizer of all parabolic subgroups of the braid groups. We apply this result to provide a new and potentially more efficient solution to the subgroup conjugacy problem for parabolic subgroups. In the course of…

We unify and generalize several approaches to constructing braid group representations from finite groups, using iterated twisted tensor products. Our results hint at a relationship between the braidings on the $G$-gaugings of a pointed…

Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first group signature schemes based on the conjugacy problem, decomposition problem and root problem in the braid…

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…

We wish to understand how irreducible representations of a group G behave when restricted to a subgroup G' (the branching problem). Our primary concern is with representations of reductive Lie groups, which involve both algebraic and…

In this article, we study the irreducibility of representations of the singular braid group on $n$ strands, namely $SB_n$. Our first finding is the determination of the forms of all irreducible representations $\rho : SB_2 \to…

The Baumslag group had been a candidate for a group with an extremely difficult word problem until Myasnikov, Ushakov, and Won succeeded to show that its word problem can be solved in polynomial time. Their result used the newly developed…

We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight line programs defined…

In the general context of presentations of monoids, we study normalisation processes that are determined by their restriction to length-two words. Garside's greedy normal forms and quadratic convergent rewriting systems, in particular those…

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…

In the present paper we study structural aspects of certain quotients of braid groups and virtual braid groups. In particular, we construct and study linear representations $B_n\to {\rm GL}_{n(n-1)/2}\left(\mathbb{Z}[t^{\pm1}]\right)$,…

We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…

We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

Group and individual solutions are considered for hard problems such as satisfiability problem. Time-space trade-off in a structured active memory provides means to achieve lower time complexity for solutions of these problems.