I tried the gcd of the 2 polynomials from Bill Hart, I get 2*z^33*y^6*x^1078*t^15-14*z^ 24*y^6*x^80*t^15+z^20*y^4*x^1003+z^20*y^3*x^1100+z^20*y^3*x^1000-2*z^13*y^3*x^79*t^16+78*z^13*y^3*x^78*t^15-7*z^11*y^4*x^5-7*z^11*y^3*x^102-7*z^11*y^3*x^2-y*x^4*t+39*y*x^3-x^101*t+39*x^100-x*t+39 after 20s using the modgcd command of giac (I'll have to check the heuristics in my gcd code because gcd was trying psrgcd...) Back to the multivariate factorization problem: I have I think good dense multivariate factorization in giac (comparable to the current versions of Maple, I did not check with singular). But I believe that this problem is really a sparse multivariate factorization problem, because if you try to do Hensel lift you must translate the polynomials otherwise the factors you get are not coprime and you can not lift. But translating will densify the polynomial a lot. And the evidence is that it requires more advanced sparse algorithms than the current implementation of giac (and singular).
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
