Identifying half-twists using randomized algorithm methods.
From MaRDI portal
Publication:1864877
DOI10.1006/jsco.2002.0521zbMath1050.20025arXivmath/0106007OpenAlexW2015343327MaRDI QIDQ1864877
Publication date: 23 March 2003
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0106007
Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Randomized algorithms (68W20)
Related Items
Cites Work
- Unnamed Item
- A fast method for comparing braids
- About the effective classification of conjugacy classes of braids
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- A new approach to the word and conjugacy problems in the braid groups
- Band-generator presentation for the 4-braid group
- Theory of braids
- ALGORITHMS FOR POSITIVE BRAIDS
- Braid monodromy factorizations and diffeomorphism types
- FROM LARGE CARDINALS TO BRAIDS VIA DISTRIBUTIVE ALGEBRA
- THE BRAID GROUP AND OTHER GROUPS