Sparse bivariate polynomial factorization

Motivated by Sasaki＇s work on the extended Hensel construction for solving multivariate algebraic equations, we present a generalized Hensel lifting, which takes advantage of sparsity, for factoring bivariate polynomial over the rational number field. Another feature of the factorization algorithm presented in this article is a new recombination method, which can solve the extraneous factor problem before lifting based on numerical linear algebra. Both theoretical analysis and experimental data show that the algorithm is etIicient, especially for sparse bivariate polynomials.

Motivated by Sasaki's work on the extended Hensel construction for solving multivariate algebraic equations,we present a generalized Hensel lifting,which takes advantage of sparsity,for factoring bivariate polynomial over the rational number field.Another feature of the factorization algorithm presented in this article is a new recombination method,which can solve the extraneous factor problem before lifting based on numerical linear algebra.Both theoretical analysis and experimental data show that the algorithm is efficient,especially for sparse bivariate polynomials.