-
see [this sage-devel discussion](https://groups.google.com/forum/?hl=en#!topic/sage-devel/lAHT1sENv9w):
```
sage: R = PolynomialRing(GF(4), ('x', 'y'))
sage: x, y = R.gens()
sage: I = R.ideal([x^2 …
-
From google spreadsheet which no one reads X-(
```
sage: R = PolynomialRing(QQ, 'x', 2)
sage: count = 0
sage: while R.ideal(1) == R.ideal(1): …
-
#36380 goes way too far, for an obviously obsolete piece of code, polybori, which just needs to be purged from Sage. It should not proceed this way.
--------------
This (#36380) PR is quite big, it…
-
Hi,
I am trying to write a polynomial ring with both symmetric and skew-symmetric variables. So I wrote this
```m2
L=RR[x1,x2,e1,e2, Inverses=>true, MonomialOrder=>Lex]/(e1*e2+e2*e1)
```
Now ho…
-
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 …
-
It would be nice to have an implementation independent interface for solving systems of polynomial equations. There will soon be an implementation here using the classical Groebner basis method and re…
-
I enter incidence algebras in QPA as in the following example that works fine:
L:=[ [ [ "'x1'", "'x2'", "'x3'", "'x4'", "'x5'", "'x6'", "'x7'", "'x8'", "'x9'", "'x10'", "'x11'" ],
[ [ "'x1'", …
-
Let's run the following program:
```
i1 : R=QQ[a..k]
o1 = R
o1 : PolynomialRing
i2 : I=trim ideal(a*b+c*d,a*e+b*f+c*g+d*h);
o2 : Ideal of R
i3 : M=cokernel gens I
o3 = cokernel |…
pzinn updated
1 month ago
-
The function `simplify(f::MPolyQuoRingElem)` below is called simplify but simplifies only in the case `f` is the zero class. The name is misleading and will lead to wrong results of functions such as …
-
I have this equation, which is [Vieta's formula](https://brilliant.org/wiki/vietas-formula/) and is polynomial.
SymPy didn't work and just hang there:
```
from sympy.abc import x, y, z, a, b, …
yw5aj updated
2 years ago