Mathias Bartl
Mathias Bartl
I was into cryptography, maybe I could do this, if CarlEdman wants to do Thue equations.
So what do you want, that these packages don't already implement?
That sounds like the best would be modifying an existing function.
So Polynomials over the integers or over finite fields?
So I could start with implementing Cantor-Zassenhaus.
Most specifically I would need an GCD algorithm first.
I assume that there is no real objection to using the Math.Polynomial package? http://hackage.haskell.org/package/polynomial-0.7.3/docs/Math-Polynomial.html
A Thue equation would be a polynomial of the form ax^3 + bx^2y + cxy^2 + dy^3 = e or similarly of a larger degree, where a,b,c,d,e are rational numbers,...
There are two definitions of Thue Equation, one for rational numbers and one for integers, see https://mathworld.wolfram.com/ThueEquation.html and https://en.wikipedia.org/wiki/Thue_equation If you look at the rational case: take a Thue equation...
According to the PARI/GP documentation "Reducible polynomials are in fact much easier to handle".