#15283: Rowmotion and Panyushev orbits: iterators for orbits and better doc
-------------------------------------------------+-------------------------
       Reporter:  darij                          |        Owner:
           Type:  enhancement                    |       Status:
       Priority:  major                          |  needs_info
      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):

 > I don't think {{{self.lt}}} returns the right format for {{{sorted}}}.
 It seems that the {{{cmp}}} keyword of {{{sorted}}} wants a total
 -1,0,1-valued function, not a boolean one.

 Well. If you insist on that, I can make it {{{lambda x,y :
 2*self.lt(x,y)-1}}} `:-P`

 > I originally wanted to implement these functions as semantics for
 {{{is_chain}}} and {{{is_antichain}}}, but found that this would make the
 docstring rather confusing.

 Really ? What do you think of this ?

 {{{
 def is_chain(verts=None):
     Checks whether the Poset (or a specific subset of it) is a chain

     INPUT:

     - ``verts`` (list of vertices) -- If ``verts`` is ``None`` (default),
       the function returns ``True`` if and only if the poset is a chain.
       If ``verts`` is a list of points, the function returns ``True`` if
       and only if ``verts`` is a chain of the poset.

     - ``ordered`` (boolean) -- Whether to consider ``verts`` as a list,
       or as a set. If ``ordered`` is set to ``True`` (default), only
       checks whether the vertices of ``verts`` are totally ordered in
       the poset. If ``ordered`` is set to ``False`` (default), checks
       whether these vertices are totally ordered with the ordering
       given by the list ``verts``
 }}}

 Nathann

--
Ticket URL: <http://trac.sagemath.org/ticket/15283#comment:12>
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.

Reply via email to