An algorithm for the word problem in braid groups
| dc.creator | Wiest, Bert | |
| dc.date | 2002-11-11 | |
| dc.date.accessioned | 2026-07-07T04:52:49Z | |
| dc.date.available | 2026-07-07T04:52:49Z | |
| dc.description | We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $σ_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical evidence for this conjecture, and prove two results: (1) The algorithm terminates in finite time. (2) The conjecture holds in the special case of 3-string braids - in fact, we prove that the algorithm finds a minimal-lenght representative for any 3-string braid. | |
| dc.description | 17 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/math/0211169 | |
| dc.identifier | http://arxiv.org/abs/math/0211169 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65612 | |
| dc.subject | Geometric Topology | |
| dc.title | An algorithm for the word problem in braid groups | |
| dc.type | text |