#16606: Bernstein creation operators and other fixes on symmetric functions
-------------------------------------+-------------------------------------
Reporter: darij | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: symmetric | Merged in:
functions, sage-combinat | Reviewers: Travis Scrimshaw
Authors: Darij Grinberg | Work issues:
Report Upstream: N/A | Commit:
Branch: public/combinat | 90d2b34372ab54b9c8b740c8ce1022b9e9026541
/witt-sf-fix | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by darij):
Alternatively, you could use the `immaculate_function` method on any basis
(I think they all go through the complete basis, so that's where you want
to do it). That gives you the immaculate function for every integer
vector.
{{{
sage: NSym = NonCommutativeSymmetricFunctions(QQ)
sage: I = NSym.I()
sage: I.immaculate_function([-1,2,2,2]) # that should be the -1-st
Bernstein of I[2,2,2]
I[1, 1, 1, 2] + I[1, 1, 2, 1] + I[1, 2, 1, 1] - I[1, 2, 2]
sage: I.immaculate_function([0,2,3,2])
-I[1, 1, 3, 2] - I[1, 2, 2, 2] - I[1, 2, 3, 1] + I[2, 3, 2]
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/16606#comment:19>
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/d/optout.
