Hello everyone, I've been trying to figure out whether the following functionality is implemented, but so far I could not. I was hoping that anyone would know if it existed and in that case what the syntax is.
Suppose you computed the reduced Groebner Basis G of an ideal I= (f1,...,fn) in some polynomial ring R, and suppose that that Groebner Basis turned out to be G=(1). Is there a function that finds some, maybe even all, combinations of coefficients h1,...,hn such that h1*f1+...+hn*fn=1? This is basically a byproduct of e.g. the Buchberger Algorithm. The question is whether this information can be accessed. Thanks to all how read this. Florian --~--~---------~--~----~------------~-------~--~----~ 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 URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
