Hecke.jl
Hecke.jl copied to clipboard
thofma
Computational algebraic number theory
The function issquarefree for f::PolyElem (not assuming that f has coefficients in a field, which may be dangerous) returns isconstant(gcd(f, derivative(f))). But this is not the condition for squarefree, rather...
For ideals in ℤ, one can use either `ideal` or `Ideal`. I could not find out, which should be used when, but definitely some basic operations only work for the...
Factorizing rationals is done via `factor(QQ(3, 4), ZZ)`, but I would expect `factor(ZZ, QQ(3, 4))` instead. The latter would be as in other Oscar functions, where we first give the...
In Hecke: `subfields(::SimpleNumField; degree)`, `subfields(C::ClassField, d::Int64) ` and in Oscar `subfields(FF::AbstractAlgebra.Generic.FunctionField{fmpq})` the degree parameter should be the "same" style and available everywhere
Some natural module operations are missing for modules over the maximal order of a number field. Namely, - Intersection in case both lattices do not have full rank. - Saturation...
For number fields `issquare` returns a tuple consisting of a boolean and a square root (if it exists) For the rationals it just returns a boolean. ```julia> F, a =...
Remove the reduced precision because of the following occur-> K= QadicField(3,2,10)[1] Qx,x = PolynomialRing(K); L=Hecke.eisenstein_extension(x^8+3)[1] L(3^10) #ior higher power is zero . I think we are working with model with...
needs to be removed since log(1)=0. example-> K = QadicField(7,4,10)[1]; Qx, x = PolynomialRing(K); L = Hecke.eisenstein_extension(x^120-7)[1]; log(1+uniformizer(L)^25) ##it should not be zero
Reference: https://arxiv.org/pdf/1304.0708.pdf Would be nice to have - "Level" of a number field (Algorithm 10) - "Pythagoras number" of a number field (Algorithm 11) - Witt equivalence of number fields...