-
```
from sympy import symbols,sympify,groebner
from sympy.solvers.polysys import solve_poly_system
s=symbols("s")
c=symbols("c")
eqns=[c**2 + s**2 - 1, -1.98079646822393*c - 0.887785747630113*s -…
-
Hello! I was wondering if `Groebner.jl` currently supports parallel computation for Groebner basis?
-
We propose a new C++ library to compute Groebner basis over finite fields with the F4 algorithm.
This library works on prime fields of characteristic < 232
and on binary field extensions of degree <…
-
One of the basic tricks when working with Groebner bases is to compute only up to a certain degree bound. Right now we support that, but then we attempt to compute the complete Groebner basis for an…
-
```
sage: R. = QQ[]
sage: I = R.ideal([a^2-a, b^2-b, a+b])
sage: GB1 = I.groebner_basis(algorithm='libsingular:slimgb')
sage: GB2 = I.groebner_basis(…
-
When computing several Groebner bases for similar ideals over similar rings, it would be helpful to be able to tell Macaulay2 partial information about the Groebner basis. For example:
Suppos…
-
The solve_poly_system function, which is used for solving systems of polynomial equations, currently implements the backsubstitution method: construct groebner basis w.r.t. the lexicographic ordering …
-
Groebner basis algorithms don't quite work with polynomials with floating point coefficients (e.g. in RR), as this is prone to rounding errors.
Prior to Sage 7.5, it was possible to do these comput…
-
An exception can be raised by testing membership of an element contained in a ring ideal, perhaps due to a bug in the Groebner basis algorithms.
The following minimal working example exercises the …
mcncm updated
1 month ago
-
Can we add an option for calculating the transformation matrix/change of basis matrix? That is, the matrix that maps the generators of the ideal to the Gröbner basis (see for example [Oscar.jl](https:…