Sorry for replying to myself what i am asking is there capacity in
sage to replicate the magma code:
>R<x, y,z> := PolynomialRing(RationalField(), 3);
>M := EModule(R, 2);
>S := sub<M | [1, x], [x, y],
[y, z]>;
>Groebner(S);
>a := M ! [y+1, z];
>a in S;
false
>b := M ! [y+1, z+x];
>b in S;
true
On 27 March 2011 13:34, Robert Goss <[email protected]> wrote:
> Hi,
>
> If I want to see if there exists polynomials a_1,...,a_n such that
>
> f = a_1*f_1 + ... + a_n*f_n
>
> where f,f_1,...,f_n are some polynomials I can just check if a is in
> the ideal generated by f_1,...,f_n.
>
> But suppose I want to see if there exists a_1,...a_n such that
>
> f = a_1*f_1 + ... + a_n*f_n
> g = a_1*g_1 + ... + a_n*g_n
>
> for some polynomials f,f_1,...,f_n,g,g_1,...,g_n is there a way in
> sage of doing this?
>
> Robert
>
--
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-support
URL: http://www.sagemath.org
