Hi all,
I have a question about a design decision for working with symmetric
functions.
I was doing some computations passing back and forth between symmetric
polynomials (finitely many variables) and symmetric functions (infinitely
many variables). When converting between a symmetric polynomial in 2
variables and one in infinitely many variables in the s-basis, I obtained a
term of -s_{111}. I understand why this is happening under the hood, but my
question is about the desired behavior. To me, it seems like
`.from_polynomial()` should only return Schur functions indexed by
partitions with at most the number of rows equal to the number of variables
in the polynomial or in the ambient ring. On the other hand, creating the
polynomial and then expanding back in terms of two variables is the
identity.
Does anyone else have any opinions on this matter? If the consensus is that
length should be bounded by number of polynomial generators, then I can
open the ticket and make the fix, but I wanted to hear some input from
others.
Thanks,
Trevor
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion visit
https://groups.google.com/d/msgid/sage-devel/26639e72-22eb-42b5-bd31-23a54f3d81edn%40googlegroups.com.
