#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):
Hellooooo again !
Hmmmm... I don't get why you needed this hack, actually. What's wrong with
the following ?
{{{sorted_o = sorted(o, cmp=self.lt)}}}
If the set is a chain then it behaves exactly as a quicksort, and
otherwise {{{.lt}}} will answer "no" from time to time -- but who cares,
you will find this out in the terminal check :
{{{all(self.lt(x[i],x[i+1]) for i in range(len(o))-1)}}}
And I still believe that this would be better in side of
`Poset.is_chain()` `:-P`
Aaaaaaand Nicolas did not think that it would be a problem but well...
That's up to you `:-P`
Have fuuuuuuuuuuuuuuuuuuuuuun !
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15283#comment:9>
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.
