Hi Michael,
Perhaps I am misunderstanding what you are trying to do. I was thinking
you were starting with a polynomial in, say, R. that you know is
symmetric and you want its expression in expressed in terms of elementary
symmetric functions. Whereas in that paper, they seem to be computing
Thanks for your reply Travis.
Here are different computations compared, which take milliseonds up to
seconds: https://orbilu.uni.lu/bitstream/10993/21949/2/ChernLib.pdf
In contrast, doing a similar computation with the same polynomials using
`SymmetricFunctions` takes hours.
However, I think t
Hi Michael,
The process is to take a polynomial, convert it to the monomial sym func
basis, then to the elementary basis (which is outsourced to symmetrica). Do
you have some references for these efficient algorithms to convert a
polynomial directly to the elementary basis?
Best,
Travis
On
Hello everyone,
I was trying and exploring the 'maximum likelihood' functionality of
Sagemath (estimating that value) and I cam across the log likelihood
estimation, however I could not find any former documentation for classical
estimation using the product method. Does Sagemath currently not h
Dear Sage developers,
currently, I am working on an alternative algorithm to compute
characteristic forms. I hope to gain a speed-up here. For this reason, I
need to express symmetric polynomials in terms of elementary symmetric
functions. At the moment, I am playing around with `SymmetricFunct
Hi all,
I recently upgraded the cookiecutter at
https://github.com/mmasdeu/sage_package_template and it works with Sage 9.0
and Travis CI. This could be made to work with Github actions as well, and
I would push to improving this one instead of sage_sample. Note that
something like sage_sample
