-
Added `matching_generating_poly`, modified `matching_polynomial`, added an option
to `permanental_minor_polynomial`, which for some graphs is faster than the previous
algorithm.
`matching_generatin…
-
This issue is intended for tracking milestones for the 2023 NumFocus small development grant for working on `scipy.special` infrastructure.
The original plan for this grant was to work on developin…
-
**Issue**
Chromatic Polynomial is useful to calculate the number of coloring of a given set of colors and the chromatic number of the graph.
I want to implement using the PolynomialFunction class …
-
-
## Reason
Adaptive polynomial chaos selectively evaluates expansion terms based on error estimates. This approach eliminates the guess work for choosing a proper polynomial order and allows the model…
-
This issue would be used to record algorithms need to be implemented.
- [ ] Fractional derivative based on [Chebyshev Polynomial](https://en.wikipedia.org/wiki/Chebyshev_polynomials) for 0
-
The Mora algorithm in M2 is supposed to return a minimal Groebner/standard basis, but sometimes it doesn't. As an example:
```
R=QQ{x,y,z}
i=ideal"xyz+z5,2x2+y3+z7,3z5+y5"
transpose…
-
I got this error:
```
julia> Pl(1.2,3)
DomainError with 1.2:
Legendre Polynomials are defined for arguments lying in -1 ⩽ x ⩽ 1
```
I am somewhat perplexed. A polynomial defined on -1 ⩽ x ⩽ …
-
As the title says.
We considered the Dilithium signature scheme and the Kyber KEM as initial "end-to-end" examples for `polynomial` and this lowering. While Dilithium shouldn't be an issue, Kyber…
-
## 🐛 Bug Report
I've been developing an experimental version of Miri that can execute foreign functions by interpreting LLVM bytecode. I was testing it on this crate, and it didn't find any borrowi…