Closed
Description
julia> using Hecke
_ _ _
| | | | | | | Software package for
| |__| | ___ ___| | _____ | algorithmic algebraic number theory
| __ |/ _ \/ __| |/ / _ \ |
| | | | __/ (__| < __/ | Manual: https://thofma.github.io/Hecke.jl
|_| |_|\___|\___|_|\_\___| | Version 0.36.0
julia> _, x = polynomial_ring(QQ, "x");
julia> F, _ = number_field(x^2-2);
julia> R, x = polynomial_ring(F, "x");
julia> f = x^10 + x^9;
julia> norm( f )
x^20 + 2*x^19 + x^18
julia> norm( f*x)
ERROR: Requires nonzero constant coefficient
Stacktrace:
[1] error(s::String)
@ Base ./error.jl:35
[2] polynomial_to_power_sums(f::AbstractAlgebra.Generic.Poly{AbsSimpleNumFieldElem}, n::Int64)
[...]
The code for polynomial_to_power_sums gets called if the argument f of norm has degree larger than 10.
Should we switch to the code for smaller degrees (base on resultants) if the constant coefficient of f is zero?
Or perhaps shift f such that it has nonzero constant coefficient?
Metadata
Metadata
Assignees
Labels
No labels