Le 23/04/2020 à 01:07, 'Travis Scrimshaw' via sage-devel a écrit :
The bottleneck in `from_polynomial` is the check to test whether the input
is actually a symmetric polynomial. If you disable the check, the
computation is moderately fast, although not quite as fast as Vincent's
code.
Sym.e().from_polynomial(P(seq_taylor), check=False)
That's quite a horrible check then! All you'd need to check is that
f(x2,x1,x3,...,xn) and f(x2,x3,...,xn,x1) are both equal to f. Perhaps it's
worth changing the check. The super-complicated procedure implemented now
(expand the representation as polynomial in the symmetric functions back
into a polynomial in the original variables) can then be relegated to a
doctest.
+1
I think that it would be good to implement this directly of the level of
multivariate polynomials. I opened
https://trac.sagemath.org/ticket/29553
Vincent
--
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 sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-devel/7629d72f-b1e1-af63-8645-fcfaa52f9031%40gmail.com.
