#18941: Poset documentation polishing: chains and antichains
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.9
Component: documentation | Resolution:
Keywords: | Merged in:
Authors: Jori Mäntysalo | Reviewers: Kevin Dilks
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jmantysalo/poset_polishing_chains| 93f35e5dd1f134f072a84f8d08971207d64d8023
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by kdilks):
{{{saturated}}} is something that only applies to strict chains, and it
means that all of your elements differ by a covering relation. Using the
standard partial (well...total) order on the integers,
{{{[1,1,2,2,3,3]}}} is a weak chain.
{{{[1,3,5,7]}}} is a strict but not saturated chain.
{{{[2,3,4,5]}}} is a strict and saturated chain.
Right now, if {{{ordered=True}}}, then it will tell you if your list of
elements is a strict but not necessarily saturated chain (in the order
given). If {{{ordered=False}}}, then it tells you whether the set of
elements you give it can be ordered in some way to make a chain.
--
Ticket URL: <http://trac.sagemath.org/ticket/18941#comment:38>
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.
