-
Doctest for RDF matrix fails on some platforms by returning the negatives of the more commonly returned eigenvectors.
See sage-release discussion:
http://groups.google.com/group/sage-release/msg/e8…
-
Algorithms exist for the computation of the roots of sparse polynomials, which are much faster than the "generic" algorithms which work for dense polynomials.
In this ticket, I implement one of the…
-
---
Apply:
[attachment: trac_14507-tropical_semiring-ts.patch](https://github.com/sagemath/sage-prod/files/10657701/trac_14507-tropical_semiring-ts.patch.gz)
CC: @darijgr
Component: **algebra**…
-
Smith form is a useful canonical form for matrices over a PID. Sage already has it for ZZ. I've coded up a very basic implementation that should work over any PID Sage knows about (although it is no…
-
In short, the decomposition function on spaces of modular symbols is mysteriously way slower than it should be. Why?
Consider this:
```
sage: M = ModularSymbols(1000,2,sign=1).new_subspace().cusp…
-
As [reported](https://groups.google.com/d/msg/sage-devel/1VHx3laSU_U/wFxF2JsABwAJ) on sage-devel
```
S = GF(2^4, 'a')
a = S.gen()
G = SL(2, S)
g1 = G([a**2, a**3 + a**2 + a, a + 1, 0])
g2 = G([a,…
-
This ticket implements the following changes to the Macaulay2 interface:
- Naming of Macaulay2/interface elements is improved.
The constructor for interface elements now correctly handles the `n…
-
**Update:** The successor to this ticket is #31404 which offers a different approach by using gappy directly in Sage rather than providing Sage-specific wrappers. I think it is overall a better app…
-
PARI's `polred()` returns reducible polynomials. GP session:
```
gp> pol = x^4 - 4294967296*x^2 + 54265257667816538374400;
gp> L = polred(pol);
gp> factor(L[4])
%14 =
[x^2 + 211955648366398871041 …
-
This patch builds vector space morphisms, aka linear transformations, from free module morphisms. This allows for a few specialized methods, such as an easier test for invertibility (check the rank…