#19141: Poset documentation polishing: Boolean-valued properties
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.9
Component: combinatorics | Resolution:
Keywords: poset | Merged in:
Authors: Jori Mäntysalo | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset_documentation_polishing__boolean_valued_properties|
d99ab5f27d400709e8108c41e3eb62623ac4f83a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* status: new => needs_review
* cc: kdilks (added)
* milestone: sage-wishlist => sage-6.9
Comment:
This contains one code change: `is_chain()` for empty poset returns
`True`.
`is_incomparable_chain_free` rejects argument `0`, as it makes no sense.
Also I added "interval order" etc. for googlers. (Code could be changed
from recursive to iterative. Or maybe just drop support for list type
argument?)
Otherwise this is mostly polishing. I tried to explain intuitively what
means for example to be ranked. Actually pictures would be good here.
I also added test for empty poset to all functions that I checked.
--
Ticket URL: <http://trac.sagemath.org/ticket/19141#comment:3>
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.
