-
`mq.MPolynomialSystem` is more general than its position in the tree suggests. I should be moved to `sage.rings.polynomial.multi_polynomial_sequence` and used as a special case of `Sequence` if the …
-
** Merge together with #13671, circular dependency **
TAB-completion advertises that the method exists, but it is NotImplemented.
```
sage: R. = QQ[]
sage: f = x+y
sage: f.inverse_mod(ideal(x,y))
…
-
Sometimes, `giacpy_sage` doctests can run out of memory. This happens on systems with many cores because too many threads are started. Analogous to #23713, the number of threads should be limited by…
-
Reduction modulo ideals in quotient rings does not return unique minimal representatives.
In this example, the ideal `J` in the quotient ring `Q = R/I` contains the element `t^2 - z^2`, so `reduce`…
-
With #4583 applied I am seeing the following issue:
```
mabshoff@sage:/scratch/mabshoff/release-cycle/sage-3.2.1.alpha0$ ./sage -t -long devel/sage/sage/rings/polynomial/multi_polynomial_ideal.py
s…
-
Two doctests/examples in `sage/rings/polynomial/symmetric_ideal.py` tend to time out on older/slower machines (and take a large amount of the overall test time of that module).
Can you say which on…
-
Hi,
Is `msolve` still available via Oscar? I tried the latest version of 0.11.2 and `msolve` does not show as a command.
Thanks!
-
We do have an optional GINV SPKG which comes with its own Python interface but no interface to it from Sage.
With the attached patch, this now works.
```
sage: P. = PolynomialRing(GF(127),order='d…
-
With the file attached, one gets:
```
sage: I = load('/home/king/Sage/work/pbori/ideal.sobj')
sage: I
Ideal (x10*x199*x206 + x10*x206*x210, x80*x192*x193*x194*x195*x196*x197*x198*x199*x201*x202 + x…
-
There are a number of inefficiencies in the critical path (i.e., the code path when values have already been cached) that are addressed in this patch.
PS:
The latest patch does in fact much more: B…