arXiv · 1201.5787
Factoring bivariate polynomials using adjoints
Abstract
One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational factorizations, and so without using Hensel's lifting. One establishes in such a way the relations between the algorithm of Duval-Ragot (locally constant functions) and of Chèze-Lecerf (lifting and recombinations), and one shows that a fast computation of adjoint polynomials leads to a fast factorization. The proof is based on cohomological sequences and residue theory.
Explore related subjects
Keep this discovery
Martin Weimann. 2012-02-17. Factoring bivariate polynomials using adjoints. https://arxiv.org/abs/1201.5787
Cite the original work for its findings. Save a collection to share your selection of sources.