Tommy Hofmann
Tommy Hofmann
Both the implementation for `is_unit` and `is_nilpotent` claim that they work for `NCPolyRingElem`: https://github.com/Nemocas/AbstractAlgebra.jl/blob/41d9716d403c83689cd5d08007c8e5c632e317da/src/NCPoly.jl#L812-L816 But I don't think this is true: 1. For technical reasons one gets: ``` julia> is_nilpotent(f)...
``` julia> b = matrix(ZZ, 2, 2, [i for i in 1:4]) [1 2] [3 4] julia> c = similar(b) [#undef #undef] [#undef #undef] julia> c == c ERROR: UndefRefError:...
After looking at the code, we (@fingolfin and myself) came to the conclusion that it would be best to forbid zero rings in polynomial ring constructors (both univariate and multivariate)...
See https://github.com/Nemocas/Nemo.jl/actions/runs/13058194155/job/36434421271?pr=2011#step:6:1004. Have not looked into it, but it appears they are coming from the conformance tests. ``` Flint exception (Impossible inverse): nmod_mpoly_divides: leading coefficient is not invertible.Flint exception (Impossible...
## Motivation The FLINT wrapper is inefficient when accessing elements of matrices or polynomials (or anything else nested). The problem is that to acesss `M[i, j]` we first create a...
Leftover from #2032 So that I don't forget: - fix the name - add the "see also" back into `reconstruct` docstring - add to documentation - export
The main offender is `fq_default` (flint) and `FqFieldElem` (Nemo). This is is a union with the largest size being 48 bytes (and the smallest being 8 byte, a single `ulong`)....
They should be as fast as `_mat_mul`. If they are not, we need to convert, call `_mat_mul` and convert back. - [x] fmpz_mat (#1937) - [ ] fmpq_mat - [...
At the moment, the `*_poly_is_irreducible` functions over finite fields say that constant polynomials are irreducible ``` julia> Fx, x = GF(2)["x"]; julia> is_irreducible(x^0) true julia> is_irreducible(0*x) true ``` Before I...