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

DOI10.1515/JGTH-2014-0020MaRDI QIDQ741273zbMATH OpenOpenAlexFDO

Authors Matthieu Calvez, Bert Wiest

Publication date 11 September 2014

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

Full work available at URL https://arxiv.org/abs/1204.6507, http://hdl.handle.net/10533/138622

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)

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.

Cited in

(5)

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