About the effective classification of conjugacy classes of braids

DOI10.1016/0022-4049(90)90023-BzbMath0701.57003MaRDI QIDQ914192

Alain Jacquemard

Publication date: 1990

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

zbMATH Keywords

complexityalgorithmword problembraid groupconjugacy problem

Mathematics Subject Classification ID

Related Items (6)

RANDOMIZED METHODS IN ARTIN GROUPS OF FINITE TYPE ⋮ PALINDROMES AND ORDERINGS IN ARTIN GROUPS ⋮ A weak key test for braid based cryptography. ⋮ Symmetric plane curves of degree 7: pseudoholomorphic and algebraic classifications ⋮ A new algorithm for solving the word problem in braid groups ⋮ Identifying half-twists using randomized algorithm methods.

Cites Work

• The minimal number of Seifert circles equals the braid index of a link
• An irreducible 4-string braid with unknotted closure
• THE BRAID GROUP AND OTHER GROUPS

This page was built for publication: About the effective classification of conjugacy classes of braids