Matthieu Calvez, Bert Wiest
Abstract
Open-access reader
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.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Conjugacy problem, Braid group, Conjugacy class, Mathematics, Braid, Braid theory, Group (periodic table), Combinatorics