New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
SSTPosets are lattices #29525
Milestone
Comments
comment:1
EDIT: sorry, wrong comparison algorithm |
Commit: |
Author: Frédéric Chapoton |
Branch: u/chapoton/29525 |
comment:2
and now, who is going to review that ? New commits:
|
comment:3
LGTM! |
Reviewer: Darij Grinberg |
Changed branch from u/chapoton/29525 to |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
https://doc.sagemath.org/html/en/reference/combinat/sage/combinat/posets/poset_examples.html#sage.combinat.posets.poset_examples.Posets.SSTPoset:
This isn't just some finite poset; it's a lattice, with minimum and maximum being defined entrywise. That should be in the code and in the doc.
Any volunteers? (My Sage isn't working and I have a long to-do list of papers right now, so I pass.)
CC: @sagetrac-sage-combinat
Component: combinatorics
Keywords: lattices, posets, tableaux, sage-combinat
Author: Frédéric Chapoton
Branch/Commit:
de3ea1f
Reviewer: Darij Grinberg
Issue created by migration from https://trac.sagemath.org/ticket/29525
The text was updated successfully, but these errors were encountered: