Den onsdag den 12. august 2015 kl. 16.07.15 UTC+2 skrev mmarco: > > I see, i got the wrong idea about the representation. Thanks for the > clarification. In that casde, it would be really interesting to run your > benchmark on a lot of different cases. Maybe the sparcity advantage gets > reduced after a big number of crossings, when we get a lot of non-zero > entries in the matrix. >
Yep, it could be fun to see how they perform on the katlas database (which I believe you've already mounted on sage) to see how they fare in 'practice'. I would imagine that sparsity correlates very strongly with the Nielsen-Thurston type of the braid (without wanting to make too precise a statement in that direction). -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
