Factoring bivariate polynomials using adjoints

DOI10.1016/J.JSC.2013.05.011zbMATH Open1287.13016arXiv1201.5787OpenAlexW2110012484MaRDI QIDQ2437285FDOQ2437285

Martin Weimann

Publication date: 3 March 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1201.5787

Recommendations

• Complexity issues in bivariate polynomial factorization
• Factoring multivariate polynomials via partial differential equations
• Lifting and recombination techniques for absolute factorization
• Bivariate factorization using a critical fiber
• Factoring polynomials via polytopes

zbMATH Keywords

CohomologySingularitiesFactorizationCurvesResiduesAdjoint polynomials

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Lectures on Resolution of Singularities (AM-166)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
• Fast separable factorization and applications
• Lectures on equations defining space curves. Notes by N. Mohan Kumar
• Residues of differentials on curves
• An Arithmetic Theory of Adjoint Plane Curves
• Sums of residues on algebraic surfaces and application to coding theory
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• Lifting and recombination techniques for absolute factorization
• A lifting and recombination algorithm for rational factorization of sparse polynomials
• Integration of rational functions: Rational computation of the logarithmic part
• Title not available (Why is that?)
• An algebraic approach to computing adjoint curves
• Computing Riemann matrices of algebraic curves
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
• Absolute Factorization of Polynomials: A Geometric Approach

Cited In (4)

• Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
• An algorithm to compute the adjoint ideal of an affine plane algebraic curve
• Sparse bivariate polynomial factorization
• Bivariate factorization using a critical fiber

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)