-
The following code
```
K. = QQ[]
M = Matrix([[x,x],[0,x]])
print( M.characteristic_polynomial().parent() )
print( M.characteristic_polynomial(y).parent() )
```
prints
```
Univariate Polynomial Ri…
-
*This is a spin-off from #14403, to get that one landed and have a discussion with a wider scope here.*
## Problem
`matrix.charpoly()` will return a polynomial in a polynomial ring over `x`. That …
-
One optimization I miss in Julia compared to other GC-based language implementations are "tagged pointers".
## The problem
Consider the `BigInt` type: it is a *lot* slower than `Int` and takes u…
-
The following tags have headlines at least 100 characters in length. This results in a warning, and if `debugLevel` is positive, an error.
```m2
+------------------------------------------…
-
it seems the solution should not be restricted to the iterative or numerical case -- it'd be possible to obtain a trigonometric solution for infinite distance based on a preliminary solution for finit…
-
Singular.jl makes many Singular functions operating on ideals available to Julia. In pull request #52 I provided a function to convert AbstractAlgebra polynomials to Singular polynomials and pull requ…
-
The quotient of `ZZ[x]` by the ideal `(x, 2)`
works fine using a multivariate polynomial ring:
```
sage: R. = PolynomialRing(ZZ, 1)
sage: I = R.ideal([x, 2])
sage: I
Ideal (x, 2) of Multivariate Po…
-
```
sage: R = PolynomialRing(QQ, 't', 1); t = R.gen()
sage: (t/2) * vector([1,2])
```
results in a
```
TypeError: unsupported operand parent(s) for *: 'Multivariate Polynomial Ring in t over Ratio…
-
Per @nschloe comment in https://github.com/sympy/sympy/pull/11728#issuecomment-256768504:
> Explicit root-finding in polynomials is probably one of the worst things you can do for finding Lobatto poi…
-
Now that the writing assignments are in, we need to get them reviewed and merged. The deadline for this is **Monday, April 18.** By that day, all pull requests should be merged, so that we have a comp…