A new algorithm for solving the word problem in braid groups
From MaRDI portal
Publication:1604340
DOI10.1006/aima.2001.2038zbMath1008.20027arXivmath/0101053MaRDI QIDQ1604340
Mina Teicher, David Garber, Shmuel Kaplan
Publication date: 4 July 2002
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0101053
68W30: Symbolic computation and algebraic computation
20F36: Braid groups; Artin groups
57M07: Topological methods in group theory
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
20-04: Software, source code, etc. for problems pertaining to group theory
20F34: Fundamental groups and their automorphisms (group-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A fast method for comparing braids
- About the effective classification of conjugacy classes of braids
- A new approach to the word and conjugacy problems in the braid groups
- Band-generator presentation for the 4-braid group
- On complexity of the word problem in braid groups and mapping class groups
- Theory of braids
- Braid Groups and Left Distributive Operations
- ALGORITHMS FOR POSITIVE BRAIDS
- FROM LARGE CARDINALS TO BRAIDS VIA DISTRIBUTIVE ALGEBRA
- THE BRAID GROUP AND OTHER GROUPS
