#17216: Poset / LatticePoset: [meet|join]matrix algorithm
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers: Nathann Cohen
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset___latticeposet___meet_join_matrix_algorithm|
a649be931b249028ff1e5961fc948c2daf50c695
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* status: needs_work => needs_review
* reviewer: => Nathann Cohen
Comment:
1) Should empty set be a lattice? Anyways, this is now corrected. Should
have a test suite containing tests for empty semilattices too. Actually a
test suite should test all properties for 0- and 1-element posets. (How
about `is_chain()`, for example?)
2) Hmm... I think I'll think about this on next round iterating throught
the code.
--
Ticket URL: <http://trac.sagemath.org/ticket/17216#comment:8>
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/d/optout.
