#20555: descents for Permutations : cleanup
-------------------------+-------------------------------------------------
Reporter: | Owner:
chapoton | Status: needs_review
Type: | Milestone: sage-7.2
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers: Travis Scrimshaw, Christian Stump
combinatorics | Work issues:
Keywords: | Commit:
permutation | 0e1c23bc2d7326980c1970e7fc0fcb379a629f78
Authors: | Stopgaps:
Frédéric Chapoton |
Report Upstream: N/A |
Branch: |
u/chapoton/20555 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by chapoton):
Concerning the first point, the very same kind of loop over self.index_set
is already used in the similar method `test_has_descent` just above in the
code. So in general I think we do expect descents to be elements of the
index set.
Concerning the second point, should I really change that ? I would prefer
not to.
--
Ticket URL: <http://trac.sagemath.org/ticket/20555#comment:23>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
