Skip to main content
9 events
when toggle format what by license comment
Apr 4, 2016 at 21:04 history edited Daniel Moskovich
edited tags
May 25, 2011 at 4:19 comment added Ryan Budney Is there something else you want to know about this group?
May 18, 2011 at 20:01 answer added Daniel Moskovich timeline score: 4
May 11, 2011 at 19:55 answer added Ryan Budney timeline score: 21
May 11, 2011 at 19:36 comment added gowers I have seen that survey and I like it very much. Perhaps you can answer another question: is the list of methods for solving the word problem given in that paper essentially complete (in the sense that all methods are small variants of one of the methods mentioned there)?
May 11, 2011 at 19:06 answer added Ian Agol timeline score: 12
May 11, 2011 at 19:05 comment added Maxime Bourrigan Just a comment on your last paragraph: There are now many ways of solving the word problem for braids quite quickly. Practically, the quickest way is Dehornoy's handle reduction. As we know have explicit faithful linear representations (thanks to Bigelow and Krammer), one can also solve the word problem by multiplying matrices... www.math.unicaen.fr/~dehornoy/Surveys/Dhu.pdf is a relevant survey.
May 11, 2011 at 18:29 history edited Ian Agol CC BY-SA 3.0
fixed some subscripts
May 11, 2011 at 15:04 history asked gowers CC BY-SA 3.0