A fast solution to the conjugacy problem in the 4-strand braid group

Abstract

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.

References in corpus (2)

• The n-th root of a braid is unique up to conjugacy
• Reducible braids and Garside theory

Cited by in corpus (1)

• The conjugacy problem and virtually cyclic subgroups in the Artin braid group quotient $B_n/[P_n,P_n]$