ON WORD REVERSING IN BRAID GROUPS

DOI10.1142/S021819670600327XzbMATH Open1114.20021arXivmath/0407333OpenAlexW1976956990MaRDI QIDQ3421603FDOQ3421603

Authors: Patrick Dehornoy, Bert Wiest 

Publication date: 7 February 2007

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/math/0407333

Recommendations

• A new algorithm for solving the word problem in braid groups
• A new approach to the word and conjugacy problems in the braid groups
• ALGORITHMS FOR POSITIVE BRAIDS
• Garside theory and subsurfaces: some examples in braid groups
• On completeness of word reversing

zbMATH Keywords

Garside groupsbraid groupspresentationsword lengthshandle reductionsword reversings

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• A fast method for comparing braids
• THE BRAID GROUP AND OTHER GROUPS
• Non-positively curved aspects of Artin groups of finite type
• Bestvina's normal form complex and the homology of Garside groups.
• Complete positive group presentations.
• Groups with a complemented presentation
• On completeness of word reversing
• STRANGE QUESTIONS ABOUT BRAIDS

Cited In (7)

• Some computational aspects in the work of Patrick Dehornoy
• On completeness of word reversing
• A cancellativity criterion for presented monoids
• On braid words and irreflexivity
• The subword reversing method.
• On the distance between the expressions of a permutation
• A conjecture about Artin-Tits groups.

This page was built for publication: ON WORD REVERSING IN BRAID GROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3421603)