#18941: Poset documentation polishing: chains and antichains
-------------------------------------+-------------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: needs_work
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| ecb16e648cdff2cb22bc88c7fd01f114af8006a5
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jmantysalo):
* status: needs_review => needs_work
Comment:
Replying to [comment:23 ncohen]:
> In particular:
>
> {{{
> sage: Set([1,2,3])[0]
> 1
> }}}
Duh. So there is no way at all in Python to check if a given container
item has fixed order? And in theory `(Set([1,2,3])[1], Set([1,2,3])[1])`
could return `(3,2)`. In reality after `P=Poset({'a':[1]})` the command
`P.is_chain_of_poset({'a', 1}, ordered=True)` will return `True` or
`False` depending on the machine that runs Python.
--
Ticket URL: <http://trac.sagemath.org/ticket/18941#comment:24>
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.
