Abstract

In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids u,v∈Bnu,v\in B_n and an automorphism ϕ∈Aut(Bn)ϕ\in Aut (B_n), decides whether v=(ϕ(x))−1uxv=(ϕ(x))^{-1}ux for some x∈Bnx\in B_n. As a corollary, we deduce that each group of the form Bn⋊HB_n \rtimes H, a semidirect product of the braid group BnB_n by a torsion-free hyperbolic group HH, has solvable conjugacy problem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.