-
Currently, monomials are represented as unboxed vectors of `Int`s. This seems rather inefficient: an unboxed vector stores an offset, a length, and the data is stored byte-per-byte instead of word-per…
sheaf updated
3 years ago
-
In Sagemath one observes:
```
sage: from sage.libs.singular.option import LibSingularOptions
sage: LibSingularOptions()["redTail"]
True
sage: R2. = PolynomialRing(QQ, 2, order="lex")
sage: LibSi…
-
I get the following error:
```
poly = sympy.Poly(sympy.minimal_polynomial(expr))
File "venv-sympy/lib/python3.8/site-packages/sympy/polys/numberfields/minpoly.py", line 701, in minimal_poly…
-
Let's check the different way we can implement the SOS constraint
``` julia
@polyconstraint q(x) >= 0 domain=[f_1(x) = 0, ..., f_m(x) = 0, g_1(x) >= 0, ..., g_p(x) >= 0])
```
There are basical…
-
```
Here is the original problem:
>>> var('lam a0 conc')
(lam, a0, conc)
>>> eqs = [lam+2*y-a0*(1 - x/2)*x-0.005*x/2*x, a0*(1 - x/
... 2)*x-1*y-0.743436700916726*y, x+y-conc]
>>> …
-
The class `QuotientRingElement`, which implements the operations an element of the quotient `R/I` of a ring `R` by an ideal `I`, suffers from several problems and limitations. Most of these were unc…
-
Here's the output from the failing build (`AssociativeAlgebras::oppositeRing` example):
```m2
-- -*- M2-comint -*- hash: -1318199081
i1 : R = QQ[q]/ideal{q^4+q^3+q^2+q+1}
o1 = R
o1 : Quot…
-
A new version of the ticket #14973 adapted to the new coding Theory framework
CC: @johanrosenkilde @sagetrac-dlucas @sagetrac-danielaugot
Component: **coding theory**
Keywords: **sd75**
Author…
-
When solving a system of nonlinear equations, if the equations are already solved for all unknowns, then it should be very fast to return the solution. However, this is not the case. For example, this…
-
Is it fine that sympy solves this more than 10 minutes?
```
from sympy import *
from sympy.solvers.solveset import nonlinsolve
x, y, a, b, c, l = symbols('x y a b c l')
#k, m, n = symbols('k m …