I went to try to answer a question posted today in sage-support and found this:
sage: P = PolynomialRing(QQ, 'x0,x1,x2')
sage: P = PolynomialRing(GF(2), 'x0,x1,x2')
sage: P.inject_variables()
Defining x0, x1, x2
sage: I = P.ideal(x0*x1+x2)
sage: I.reduce(x2)
x2
sage: R = PolynomialRing(GF(2), 'x0,x1,x2', order='wdegrevlex')
sage: R.inject_variables()
Defining x0, x1, x2
sage: J = R.ideal(x0*x1+x2)
sage: J.reduce(x2)
verbose 0 (3831: multi_polynomial_ideal.py, groebner_basis) Warning: falling 
back to very slow toy implementation.
verbose 0 (3831: multi_polynomial_ideal.py, groebner_basis) Warning: falling 
back to very slow toy implementation.
---------------------------------------------------------------------------
Traceback (most recent call last):
...
TypeError: zip argument #2 must support iteration


Cheers, R.
--
You received this message because you are subscribed to the Google Groups 
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/sage-devel/20200805142045.GB7489%40vertex.

Attachment: signature.asc
Description: PGP signature

Reply via email to