Is it possible to define multivariate polynomials where the coefficients lie in a rational function field and do Groebner basis computations on them? Maple, Reduce and Axiom support this. For example I would like to be able to compute the Groebner basis of the polynomials where the polynomials belong to the ring Q(u,v)[x,y]. I tried the following This fails with the error |

Make u and v be in the Fraction field:
Thanks, that works perfectly. Now my quest for the Elimination ideal
I2 = I.elimination_ideal([x])
fails with
TypeError: Cannot call Singular function 'eliminate' with ring parameter
of type ' |

When I try this, the error I get is a little more informative: The function which is a wrapper for the Singular function and is supposed to convert Sage's rings to rings that Singular understands . . . however it seems that this wrapper does not understand the Maybe someone who knows more about the Singular interface can help here? |

Asked: **Aug 26 '10**

Seen: **429 times**

Last updated: **Aug 26 '10**

powered by ASKBOT version 0.7.22

Copyright Sage, 2010. Some rights reserved under creative commons license.