-
In sympy 1.0 with Python 3.5 I tried to solve the following system of polynomial equations:
```python
from sympy import symbols, solve
a, b, c, d, e, f, g = symbols('a b c d e f g')
terms = [
…
-
The following groebner basis computation over integers is
not correct (compare with M2 or Magma):
```
sage: R. = PolynomialRing(ZZ, 3, order='lex')
sage: I = Ideal(13*x*y*z+6*x*y+78*x*z+36*x-11*y…
-
- There should be a brial testsuite that exhibits the issue
- The segfault is possibly(?) due to the different code path with hash maps
-
See Description field in Pull requests #3.
-
Parameters:
mpoly list
ring (optional)
Returns:
mpoly list
-
Till #17254 is ready. Let's add another patch to singular to fix a build issue with GCC 6.
Component: **build**
Keywords: **GCC6 c++11**
Author: **André Apitzsch**
Branch: **[`04c0af9`](https://…
-
Hi,
sorry for presenting things piecemeal like that, but here is another [VC](https://gist.github.com/kanigsson/1944aeb3fcddfe677de7ddbd7fd7e755) with a relatively low rlimit that takes over a minute…
-
Here is code that works:
``` coq
Require Import Coq.Reals.Reals Coq.nsatz.Nsatz.
Local Open Scope R.
Goal forall a b yx xz : R,
yx^2 = xz^3 + a * xz + b ->
(- yx)^2 = xz^3 + a * xz + b ->
xz …
-
The 2d ideal could use some work. The convex hull does not work well and the menu does not exist.
-
To enable groebner basis for rings such as Zmod(large integer) the monomial functions need to written for MPolynomialRing_polydict.
Since they are currently written for MPolynomialRing_polydict_dom…
bhutz updated
8 years ago