-
While trying to use Groebner bases, the following code seems to enter an infinite loop:
from sympy import *
a, b, c, d, e, f, g = symbols('a, b, c, d, e, f, g')
h, i, j, k, l, m, n …
sukop updated
5 years ago
-
This is a tad overwhelming:
```m2
i1 : about "bner"
o1 =
{31 => Macaulay2Doc::computing Groebner bases }
{32 => Macaulay2Doc::Elementary uses of Gro…
-
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…
-
### Is there an existing issue for this?
- [X] I have searched the existing issues for a bug report that matches the one I want to file, without success.
### Did you read the documentation and t…
-
While using this package (quite nice in general) in our research with Professor Nora Youngs, we discovered the methods NeuralCode.groebner_basis() and NeuralCode.universal_groebner_basis() are both de…
-
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 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…
-
The GAP package [GBNP](https://gap-packages.github.io/gbnp/), according to its documentation, "provides algorithms for computing Gröbner bases of noncommutative polynomials with coefficients from a …
-
`groebnerBasis` is a version of `gb` somewhat equivalent to `gens gb` that also employs additional strategies that do not return `GroebnerBasis`.
At this point (apart from documentation not being p…
-
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:…