Factoring bivariate polynomials using adjoints

Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05) Singularities of curves, local rings (14H20) Plane and space curves (14H50) Symbolic computation and algebraic computation (68W30)

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`eze-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.

Review text

The author studies the problem of factoring bivariate polynomials. To describe these results more precisely suppose that \(k\) is a field, that \(\overline{k}\) is an algebraic closure of \(k\), and that \(F \in k[x,y]\) is a bivariate polynomial of degree \(d\). In addition suppose that \(F\) satisfies the condition that the polynomial \(F(0,y)\) is separable of degree \(d\). In this setting the main result of this paper is an algorithm which yields, under suitable additional hypothesis on \(k\), factorizations of \(F\), both over \(k\) and \(\overline{k}\), assuming given the knowledge of a \(k\)-basis of the vector space \(A\) of adjoint polynomials of \(F\). The author then proves a number of results which concern the complexity this algorithm. These results are related both to the complexity of factoring \(F\) given the knowledge of a \(k\)-basis of \(A\), and also the complexity of computing the vector space \(A\) itself. Finally the author considers concrete illustrative examples. To describe some results, contained in this paper, which make the author's algorithm possible let \(\mathcal{C} \subseteq \mathbb{P}^2\) be the plane curve determined by \(F\). Also suppose that \(Z \) is the closed subscheme of \(\mathcal{C}\) defined by the scheme theoretic intersection of the strict transforms, with respect to a weak embedded resolution of \(\mathcal{C}\), of \(\mathcal{C}\) and a suitable line in \(\mathbb{P}^2\). In this notation, a key step in the author's algorithm is to show that the cokernel of the restriction map \[ \alpha : H^0(\mathcal{C},\mathcal{O}_C) \rightarrow H^0(Z, \mathcal{O}_Z) \] can be effectively computed. This, as the author shows, is achieved by the theory of residues. The next key step is to relate the cokernel of \(\alpha\) to the vector space of adjoint polynomials \(A\), that is the vector space of polynomials which determine the adjoint curves of \(\mathcal{C}\).

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Factoring bivariate polynomials using adjoints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437285)