-
The Mora algorithm in M2 is supposed to return a minimal Groebner/standard basis, but sometimes it doesn't. As an example:
```
R=QQ{x,y,z}
i=ideal"xyz+z5,2x2+y3+z7,3z5+y5"
transpose…
-
Hi,
The `groebner` returns the unique Reduced Gröbner bases by default, for any ordering, correct? Then why does the example below NOT have leading coefficient 1 ? This is an example from the docum…
-
I'm having trouble computing the Groebner basis for high-order Runge Kutta systems. Specifically, I'm working with a problem that has 8 stages and order 7, and the system of equations is given in [thi…
-
The new functionality provided by PR #3868 does not (yet) fit with the `groebner_basis` function. Can someone with knowledge please adjust the `groebner_basis` function and add an example to the test…
-
A bug report on [sage-devel](http://groups.google.com/group/sage-devel/browse_thread/thread/46124695d2f7469a) made me play around with the following example:
```
sage: R.=PolynomialRing(ZZ,2)
sage:…
-
**Is your feature request related to a problem? Please describe.**
Many programs for dynamical system naturally have constraints of the form "f(x) is SOS for all g(x) = 0". For example, when searchin…
-
Due to the new definition of `is_global`, the following error is not caught by
https://github.com/oscar-system/Oscar.jl/blob/c45e777cba4ef1ef0643e1712f5f09d221db6c45/src/Rings/groebner.jl#L159-L160
…
-
Using 9.5.rc0 and system giac 1.7.0-45:
```
sage-9.5.rc0 -t --long --verbose --random-seed=207028792283788636028114220041760561940 src/sage/libs/giac/__init__.py
...
Trying (line 172): from sage…
-
While trying to find a Groebner basis, a message like this is output:
```
Info: Possible overflow of exponent vector detected.
Restarting with at least 32 bits per exponent.
```
Does this mea…
-
I have implemented a decoding method for general linear codes in Sage. The method decodes up to half the true minimum distance using Groebner bases. This method was introduced by Bulygin and Pellika…