# Groebner basis computation

How we can use SageMath for computing Groebner basis? e.g. we have 35 multivariate polynomial equations, is it possible to compute groebner basis at a time?

Groebner basis computation

add a comment

2

You may do something like:

```
sage: R = QQ['x,y,z']
sage: R
Multivariate Polynomial Ring in x, y, z over Rational Field
sage: x,y,z = R.gens()
sage: I = ideal(x^5 + y^4 + z^3 - 1, x^3 + y^3 + z^2 - 1)
sage: B = I.groebner_basis()
sage: B
[y^6 + x*y^4 + 2*y^3*z^2 + x*z^3 + z^4 - 2*y^3 - 2*z^2 - x + 1,
x^2*y^3 - y^4 + x^2*z^2 - z^3 - x^2 + 1,
x^3 + y^3 + z^2 - 1]
```

This example was taken from the documentation on Ideals in multivariate polynomial rings

Please start posting anonymously - your entry will be published after you log in or create a new account.

Asked: ** 2019-02-06 07:49:28 +0200 **

Seen: **180 times**

Last updated: **Feb 06 '19**

Explicit representation of element of ideal

Polynomial as a sum of simply factored expressions?

Turning an expression into a multivariate polynomial?

multivariate polynomial root-finding

Multivariate Polynomials over Rational Function Fields

How do I Pass a tuple as an argument for a multivariate polynomial?

Is there an example of how i could write a polynomial as a product of linear factors

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.