#13250: Additional poset examples
---------------------------------+------------------------------
Reporter: csar | Owner: sage-combinat
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.11
Component: combinatorics | Resolution:
Keywords: sd40 | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Dependencies:
Stopgaps: |
---------------------------------+------------------------------
Comment (by csar):
Replying to [comment:6 tscrim]:
> - The `cell_leq` method is not needed since the default comparison
between lists/tuples in python is lex which matches your definition (and
your current implementation does not match your def'n in that the def'n
has "or" whereas the test has "and").
I think what I had written was just wrong. This is supposed to be the
order that the entries of standard Young tableaux satisfy, so it isn't
lex. I've rewritten it to check for covering relations (and it now occurs
to me the function should be renamed--I'll do that after I write this).
> - You'll need to put your real name as the author.
Name where? On the ticket?
The patch isn't ready to be reviewed, despite me having uploaded a new
version. I noticed there's a way to simplify
`YoungsLatticePrincipalOrderIdeal`.
--
Ticket URL: <http://trac.sagemath.org/ticket/13250#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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
