-
Hello jonathf!
I have been using your modules in my research for a while now and I love them. I have stumbled upon a problem I can't manage to solve, however.
I have an array of polynomials (wit…
-
The implementation of the FFT QSP method described by this [paper](https://arxiv.org/abs/2406.04246) uses a lot of memory at high precision. The number of Fourier modes needed to maintain a target pr…
-
These are currently skipped tests for users to track where they could contribute
### Linear algebra ([numpy.linalg](https://numpy.org/doc/stable/reference/routines.linalg.html#module-numpy.linalg…
-
Greetings!
In the documentation and in the code there seem to be missing a "pretty format parser" for univariate modular polynomials.
For multivariate there is a nmod_mpoly_set_str_pretty, but there…
-
I would like an implementation of multivariate resultants in Oscar, analogous to the Singular implementation, compatible with polynomials over Flint fields. There is resultant(::MPoly, ::MPoly, ::Int)…
-
I am adding some results on rings:
- [x] Ring ideal definition
- [x] Product and sum of ideals
- [x] Prime ideal definition
- [x] Maximal ideal definition
- [x] Spectrum and Zariski topology
-…
-
Dear authors,
Thanks for sharing the code of the excellent work.
I notice that the implementation of Jacobi basis is different from the gold form of recurrence relations of Jacobi polynomials, a…
-
Having just implemented a polyfill for elementary math, that got me thinking about some related ideas:
1. The most obvious concept related to long division is synthetic division. It is basically the …
-
Are the first two polynomials in the function fmpz_mpoly_compose_fmpz_mpoly allowed to be the same? I haven't found anything in the documentation that would tell me otherwise.
If so, the following (C…
-
The generated functions for evaluating the weights in the Chebyshev polynomials take twice as long to run as the regular functions, but use about the same amount of memory. This may be due to the use…