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

DOI10.1515/JGTH-2014-0020zbMATH Open1303.20045arXiv1204.6507OpenAlexW2964216967MaRDI QIDQ741273FDOQ741273

Authors: Matthieu Calvez, Bert Wiest 

Publication date: 11 September 2014

Published in: Journal of Group Theory (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1204.6507

zbMATH Keywords

algorithmscomputational complexityconjugacy problemconjugacy search problembraid lengthsfour-strand braid group

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (5)

• The conjugacy problem for groups of alternating prime tame links is polynomial-time
• A family of pseudo-Anosov braids with large conjugacy invariant sets.
• The conjugacy problem and virtually cyclic subgroups in the Artin braid group quotient \(B_n/[P_{n},P_{n}]\)
• Garside theory and subsurfaces: some examples in braid groups
• Fast Nielsen-Thurston classification of braids.

This page was built for publication: A fast solution to the conjugacy problem in the four-strand braid group.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741273)