Solving random equations in Garside groups using length functions.

zbMATH Open1200.20030arXivmath/0611918MaRDI QIDQ5748113FDOQ5748113

Authors: Martin Hock, Boaz Tsaban 

Publication date: 14 September 2010

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

Recommendations

• Probabilistic solutions of equations in the braid group.
• Normal forms of random braids.
• A new algorithm for solving the word problem in braid groups
• Reading the dual Garside length of braids from homological and quantum representations.
• Conjugacy problem for braid groups and Garside groups.

zbMATH Keywords

length functionsArtin presentationgeodesicsGarside groupsnormal form theoremsrandom equationsArtin braid groupsminimal length elementsBirman-Ko-Lee presentationgeodesic lengthsmemory-length algorithms

Mathematics Subject Classification ID

Cryptography (94A60) 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) Algebraic geometry over groups; equations over groups (20F70)

Cited In (4)

• Normal forms of random braids.
• Random equations in nilpotent groups.
• Random equations in free groups.
• Probabilistic solutions of equations in the braid group.

This page was built for publication: Solving random equations in Garside groups using length functions.

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