-
### Steps To Reproduce
```
sage: version()
'SageMath version 10.5.beta5, Release Date: 2024-09-22'
sage: Pyab. = FreeAlgebra(QQ,2)
sage: f = 2*a - 2*b + a*b - b*a
sage: f
2*a - 2*b + a*b - b*…
-
- wrong structure of project -1pt
- no descriptions of functions in hpp file -1pt
- root_rational_candidates too long and logic should be divided (we have written a proper version of this function …
-
I'm observing unexpected behavior in ImHex 1.35.4 where `std::hash::crc32()` returns a different result on every evaluation in the pattern editor console.
Context: I am writing a pattern to parse a…
-
Rayon and Tokio could be used to improve these kind of code.
```rust
// Evaluate the values p_i(x_i) for i=1,2,...,n and add to the transcript
for (poly, point) in polynomial_list…
-
### Is this a unique feature?
- [X] I have checked "open" AND "closed" issues and this is not a duplicate
### Is your feature request related to a problem/unavailable functionality? Please describe.…
-
Hi,
Does Flint have multi-point evaluation of multivariate polynomials at geometric sequences over finite fields ?
For example, something like the matrix-vector product with a transposed Vander…
-
...from the proof for the "non-packed accountable" scheme.
-
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…
-
@aseyboldt noticed that we might be missing some (scalar) polynomial optimizations like [Horner's method](https://en.wikipedia.org/wiki/Horner%27s_method).
-
In folding, we have to evaluate custom gates/cross terms polynomials for each row $j$:
$$P(x_1, x_2, \dots, x_n) = \sum_{i_1, i_2, \dots, i_n} c_{i_1, i_2, \dots, i_n} x_1^{i_1} x_2^{i_2} \cdots x_…