Ah! Thanks a lot for this "trick" of iteration! Day by day I am
learning new tricks with sage :-)
By the way after seeing your reply I saw a mathematical "typo" in my
code: I should reduce I3 modulo I2 and not the other way round :-)
Anyways, I have already taken of in my main program.
Thanks a lot once again...
-- VInay
On Sep 28, 11:57 pm, john_perry_usm <john.pe...@usm.edu> wrote:
> Try this:
>
> sage: I3_red_I2 = R.ideal([p.reduce(I2gb) for p in I3gb])
>
> regards
> john perry
>
> On Sep 28, 12:24 am, Vinay Wagh <wagh...@gmail.com> wrote:
>
>
>
>
>
>
>
> > Suppose I have two ideals I & J in k[X_1,\cdots,x_n], where k is a
> > field. How do I reduce an ideal I wrt ideal J.
>
> > e.g. Singular provides me a command
>
> > singular > reduce(I,std(J));
>
> > Without moving back and forth to Singular, is it possible to implement
> > this in sage?
>
> > I tried the following code:
>
> > sage: R.<X,Y,Z> = PolynomialRing(QQ,3,order=TermOrder('wdeglex',[4,6,11]));
> > sage: I = R.ideal(X^2-Y^3+Z^4, Y^5-Z^6+X^7, Z^13-X^12+Y^11);
> > sage: I2 = I*I;
> > sage: I3 = I2*I;
> > sage: I2gb = I2.groebner_basis();
> > sage: I3gb = I3.groebner_basis();
> > sage: I2gb
> > sage: I3_red_I2 = reduce(I3, I2gb);
>
> > The last command (redece) is giving me an error. I am not getting what
> > wrong I am doing...
>
> > Thanks and regards
>
> > -- VInay Wagh
--
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
