HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Factoring bivariate polynomials using adjoints

Abstract : We relate factorization of bivariate polynomials to singularities of projective plane curves. We prove that adjoint polynomials of a polynomial F ∈ k[x, y] with coefficients in a field k permit to recombinations of the factors of F (0, y) induced by both the absolute and rational factorizations of F , and so without using Hensel lifting. We show in such a way that a fast computation of adjoint polynomials leads to a fast factorization. Our results establish the relations between the algorithms of Duval-Ragot based on locally constant functions and the algorithms of Lecerf and Chèze-Lecerf based on lifting and recombinations. The proof is based on cohomological sequences and residue theory.
Complete list of metadata

Cited literature [32 references]  Display  Hide  Download

Contributor : Martin Weimann Connect in order to contact the contributor
Submitted on : Wednesday, May 22, 2019 - 9:59:16 PM
Last modification on : Tuesday, October 19, 2021 - 11:34:31 PM


Files produced by the author(s)




Martin Weimann. Factoring bivariate polynomials using adjoints. Journal of Symbolic Computation, Elsevier, 2013, 58, pp.77-98. ⟨10.1016/j.jsc.2013.05.011⟩. ⟨hal-02137322⟩



Record views


Files downloads