#16998: Documentation conflict on is_graded()
---------------------------------+------------------------
Reporter: jmantysalo | Owner:
Type: defect | Status: new
Priority: minor | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+------------------------
Comment (by stumpc5):
Some time ago (maybe 2 years), we (a few Sage-Combinat people) agreed on
the following definitions:
A poset is '''graded''' if all maximal chains have the same length.
A poset is '''ranked''' if it admits a rank function.
A '''rank function''' f is a integer valued function on the vertices of a
(finite) poset P such that
* f(p) = 0 if p is a minimal element in P, and
* f(q) = f(p)+1 if p \prec q is a cover relation in P.
--
Ticket URL: <http://trac.sagemath.org/ticket/16998#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.
