#14019: equality is broken for Posets
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: sage-combinat
Type: defect | Status: needs_info
Priority: major | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by ncohen):
There's nothing related to isomorphism in what I said. The same way that
you expect that int(1) == Integer(1) is True, I would like that two posets
that represent the very same partially ordered set be equal. This is
totally linear, and consists in checking that i<j in one poset if and only
if i<j in the other one. That's not an isomorphism, there is no relabeling
involved.
This being said, I would like to have an answer to my question above. Not
being able to define an `__eq__` function as you see fit because of the
parent stuff looks to me like a problem.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14019#comment:17>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
