#8593: Add Lehmer code of Permutation as an infinite enumerated set
-----------------------------+----------------------------------------------
Reporter: nborie | Owner: nborie
Type: enhancement | Status: new
Priority: major | Milestone: sage-4.4
Component: combinatorics | Keywords: code, permutation
Author: | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------+----------------------------------------------
The goal of this ticket is to implement Lehmer_codes as a parent
(InfiniteEnumeratedSets()). One of the goal is to use this features to
index Schubert evaluation points and Schubert polynomials.
There is also an iterator over all codes, and two methods for elements
is_dominant() (easy Schubert) and is_anti_dominant() (symmetric Schubert).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8593>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
