Hi Let's say that I have a multivariate polynomial ring R which contains the polynomials p, f1, ..., fn. I also know that p is in the ideal J = <f1,..., fn>. Now I wish to write p as a polynomial in the f- polynomials. How can I do that with Sage?
I can get some of the way by constructing J and ask for a Gröbner basis for J. Let's call that basis g1, ..., gs. Then I can call "J.reduce(p)" to assert that p is indeed in the polynomial (when it returns 0). But this doesn't give me a polynomial expression for p in neither the f-polynomials or the g-polynomials. Now, writing the algorithm for describing p as a polynomial expression in the g- polynomials is not very hard, but then I still need to describe the g- polynomials in the original f-polynomials and combine the results before I am done. What functionality does Sage already provide with these things? Cheers, Johan -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
