On word reversing in braid groups
| dc.creator | Dehornoy, Patrick | |
| dc.creator | Wiest, Bert | |
| dc.date | 2004-07-20 | |
| dc.date.accessioned | 2026-07-07T05:10:29Z | |
| dc.date.available | 2026-07-07T05:10:29Z | |
| dc.description | It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a word by at most a linear factor depending on the group presentation only. We give a counter-example to this conjecture, but, on the other hand, we establish length upper bounds for the case when only right reversing is involved. We also state a new conjecture which would, like the above one, imply that the space complexity of the handle reduction algorithm is linear. | |
| dc.identifier | https://arxiv.org/abs/math/0407333 | |
| dc.identifier | http://arxiv.org/abs/math/0407333 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71943 | |
| dc.subject | Group Theory | |
| dc.subject | MSC 20F36, 20F10 | |
| dc.title | On word reversing in braid groups | |
| dc.type | text |