#8259: Conversion from symmetric polynomials to basis of monomial symmetric
functions
------------------------------+---------------------------------------------
Reporter: aschilling | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3.4
Component: combinatorics | Keywords: symmetric functions
Author: Anne Schilling | Upstream: N/A
Reviewer: Jason Bandlow | Merged:
Work_issues: |
------------------------------+---------------------------------------------
Comment(by jbandlow):
One more thing. I would really like to have an option to verify that the
input actually is a symmetric function. In fact I think this should be
true by default. So the key function would look something like this:
{{{
def from_polynomial(self, f, check=True):
assert(self.base_ring() == f.base_ring()
d = dict([(e,c) for e,c in f.dict().iteritems() if tuple(sorted(e)) ==
tuple(reversed(e))])
if not check:
return self.sum(d[la]*self(Partition(la)) for la in d.keys())
out = self.sum(d[la]*self(Partition(la)) for la in d.keys())
assert( out.expand(f.parent().ngens(),f.parent().gens()) == f )
return out
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8259#comment:7>
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.
