#15283: Rowmotion and Panyushev orbits: iterators for orbits and better doc
-------------------------------------------------+-------------------------
Reporter: darij | Owner:
Type: enhancement | Status:
Priority: major | positive_review
Component: combinatorics | Milestone: sage-5.13
Keywords: posets, rowmotion, sage- | Resolution:
combinat, panyushev, order-ideals, categories | Merged in:
Authors: Darij Grinberg | Reviewers: Nathann
Report Upstream: N/A | Cohen
Branch: | Work issues:
Dependencies: | Commit:
| Stopgaps:
-------------------------------------------------+-------------------------
Comment (by darij):
Thanks, Nathann and Nils, for your comments. I've decided to provide two
implementations for `is_chain`, one using sorting when the poset is finite
(in which case, as Nils suggests, I'll use a `key` attribute), one by
checking all pairs of possible relations when the poset is not assumed
finite.
I'm still reluctant to make this part of the existing `is_chain` method.
I'm carrying this over into a new ticket: #15322. Please disregard the
additions-dg.patch I posted here, as it is buggy.
--
Ticket URL: <http://trac.sagemath.org/ticket/15283#comment:17>
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/groups/opt_out.
