| 1 | initial version |
The following pages in the sagemath documentation contain most of the information
In SageMath you need to create a polynomial ring for each term ordering
R1 = PolynomialRing(QQ, 'x,y,z,w', order='lex')
R2 = PolynomialRing(QQ, 'z,w,x,y', order='lex')
R3 = PolynomialRing(QQ, 'w,y,z,x', order='lex')
Then the groebner basis can be computed via
g1 = R1.ideal(L).groebner_basis()
g2 = R2.ideal(L).groebner_basis()
g3 = R3.ideal(L).groebner_basis()
But as far as I know, there is no such thing as isolve in SageMath, see also question 8360 and question 9479.
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.