Of course, with 100 polynomials, any computer algebra system might cry uncle when trying to compute the Groebner basis... depends on the system.
regards john perry On Jan 28, 8:34 am, Simon King <[email protected]> wrote: > Hi, > > On 28 Jan., 15:19, Santanu Sarkar <[email protected]> > wrote: > > > Suppose in an array A[100], I have 100 polynomials over R.<x,y,z>=QQ[] > > I first want to construct an ideal generated by this polynomial. Then I want > > to find the Groebner Basis. > > How this can be done in Sage? > > > When we have three polynomials f1,f2,f3 we use the following. > > I=(f1,f2,f3)*R > > B=I.groebner_basis() > > What do you mean by "array A[100]"? Do you mean a list A that is > formed by 100 polynomials? Then of course it is > sage: I = A*R > sage: B = I.groebner_basis() > > Cheers, > Simon -- 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
