Hi everyone, I guess this subject has already been discussed somewhere but I'm not aware of it so I'm asking the question here.
Looking into hash functions, I discovered that many combinatorial objects have weird equality between them. Basically: if they are equal as lists, they are considered equal as objects. And it seems to me that this is really wrong (but also difficult to change, because I guess this has repercussions in lots of places). Here is an example sage: Permutation([2,1,3]) == Composition([2,1,3]) True sage: Permutation([2,1,3]) == [2,1,3] True sage: Permutation([3,2,1]) == Partition([3,2,1]) True So I guess some of you guys are already aware of this, do you want it to stay like this or is there a plan to change it? Cheers -- 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/groups/opt_out.
