It's not related to #14019, but a problem with <= comparison in the tensor product of crystals code. I inadvertently ended up fixing this with #15882 trying to get full coverage to combinat/crystals/tensor_product.py:
sage: u,v = crystals.Tableaux(['A',2], shape=[2,1])[:2] sage: u,v ([[1, 1], [2]], [[1, 2], [2]]) sage: u <= v True sage: v <= u False So let's finish #15882. Nathann, could you do a review of its dependency #14275? Best, Travis On Tuesday, April 1, 2014 8:25:29 AM UTC-7, Nathann Cohen wrote: > > Ahem. Of course, the graph there is totally useless :-P > > sage: u,v = CrystalOfTableaux(['A', 3], shape = [2,1,1])[:2] > sage: u<=v > <same result> > > Nathann > > On Tuesday, April 1, 2014 4:43:20 PM UTC+2, Nathann Cohen wrote: >> >> Hello everybody ! >> >> I am just reporting a bug found on #15978 (which should make digraphs >> a bit faster and is otherwise totally unrelated) >> >> sage: Tab = CrystalOfTableaux(['A', 3], shape = [2,1,1]) >> sage: g=Tab.digraph() >> sage: u,v = g.vertices()[:2] >> sage: u <= v >> ... >> RuntimeError: maximum recursion depth exceeded in cmp >> >> Looks like the same kind of stuff that happened when I was working on >> #14019. >> >> Nathann >> > -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-combinat-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-combinat-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/d/optout.
