#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 ncohen):
Right. Now that I think of it, though, it can be implemented better :
* Check that an ordered list is indeed a chain : only `n-1` comparisons
* Check that a set is indeed a chain : quicksort using `n log(n)`
comparisons, then check if the (ordered) result makes sense with `n-1`
comparisons.
Anyway, if this function is useful at some point it can still be
implemented in a `.is_chain` method with a `vertices=[...]` argument
(possibly equal to `None` to mean "self") and a `ordered=True` parameter
for this second problem `:-D`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15283#comment:7>
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.
