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

DOI10.1515/JGTH-2014-0020zbMath1303.20045arXiv1204.6507OpenAlexW2964216967MaRDI QIDQ741273

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

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)

Related Items (3)

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.