-
This comes from a discussion with @TobiaMarcucci
Currently our `Polynomial` class is written as a linear combination of monomials `∏xᵢᵈⁱ`. As mentioned in the previous literature, monomials are "b…
-
```julia
julia> using SnoopCompileCore
julia> invalidations = @snoopr using Polynomials;
julia> using SnoopCompile
julia> trees = invalidation_trees(invalidations);
julia> length(trees)
…
-
Add
- the `OrePolynomialEvaluation` class taking
an Ore polynomial `P` in `K[X, sigma, der]`
and an element `c` in `K`. This class
represents the morphism `P(c*sigma + der)`.
- a method in t…
-
* `a.lcm(b)` where `a` and `b` are constant polynomials is broken over a variety of rings:
```
sage: R. = RR[]
sage: R(2^31).lcm(R(2*x+1)) # Boom
```
```
sage: R. = FractionField(QQ['t…
-
In general `(p^t)`-minimal polynomials of a matrix `B` are not uniquely determined but two different `(p^t)`-minimal polynomials are congruent modulo `p (N_{p^{t-1})}(B)` where `N_{(p^{t-1})}(B)` is…
-
1. faster creation of new Laurent polynomial via a `cdef _new_c` method
2. Make rich comparison compatible with polynomials
3. make Laurent polynomial complient with coercion for `/` so that the res…
-
I am getting infinite overflows when computing Legendre polynomials of high order:
```matlab
>> [data, dataD] = associated_legendre(360, 0.0, 'none');
>> data(150, 150)
ans = -1.2553e+304
>> d…
-
### Steps To Reproduce
The following code prints `False`, which is clearly wrong. At the same time, removing `order=f'degrevlex(1),degrevlex(2)'` from the ring `K` definition makes things work as exp…
-
On [this image](https://user-images.githubusercontent.com/173672/228843793-224e21b8-10e2-4d2b-b4a3-785fc7379267.png) Bing tried to write text `, then f(x) + 2ax + a^2 must also be a perfect`, but inst…
-