pseudo-remainder of a polynomial by a regular chain
SparsePseudoRemainder(p, rc, R)
SparsePseudoRemainder(p, rc, R, out_h)
regular chain of R
polynomial of R
polynomial of R (optional)
The function call SparsePseudoRemainder(p, rc, R, out_h) returns a polynomial r such that h⁢p equals r modulo the ideal generate by rc where h is a product of the initials of rc. Moreover, the returned polynomial r is reduced with respect to rc.
If out_h is provided then it is assigned h.
It is assumed that pseudo-division of p by the successive polynomials of rc sorted by decreasing order of main variable.
This command is part of the RegularChains package, so it can be used in the form SparsePseudoRemainder(..) only after executing the command with(RegularChains). However, it can always be accessed through the long form of the command by using RegularChains[SparsePseudoRemainder](..).
R := PolynomialRing([x, y, z]);
rc := Construct(z^2+1, Empty(R), R);
p := z^3 ;
SparsePseudoRemainder(p, rc, R);
rc := Construct(z*y^2+1, rc, R);
SparsePseudoRemainder(y^2+1, rc, R);
Download Help Document
What kind of issue would you like to report? (Optional)