Bivariate factorization using a critical fiber

DOI10.1007/S10208-016-9318-8MaRDI QIDQ1683738zbMATH OpenOpenAlexFDO

Authors Martin Weimann

Publication date 1 December 2017

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

singularityalgorithmcomplexitydiscriminantfactorizationvaluationresultantNewton polytopebivariate polynomialresiduesHensel lifting

Mathematics Subject Classification ID

Singularities of curves, local rings (14H20) Polynomials, factorization in commutative rings (13P05) Computational aspects of algebraic curves (14Q05)

Abstract: We generalize the classical lifting and recombination scheme for rational and absolute factorization of bivariate polynomials to the case of a critical fiber. We explore different strategies for recombinations of the analytic factors, depending on the complexity of the ramification. We show that working along a critical fiber leads in some cases to a good theoretical complexity, due to the smaller number of analytic factors to recombine. We pay a particular attention to the case of polynomials that are non degenerate with respect to their P-adic Newton polytopes.

Recommendations

• A lifting and recombination algorithm for rational factorization of sparse polynomials
• Complexity issues in bivariate polynomial factorization
• Factoring bivariate polynomials using adjoints
• Lifting and recombination techniques for absolute factorization
• Factoring polynomials via polytopes

Cites work

• scientific article; zbMATH DE number 3957242 (Why is no real title available?)
• scientific article; zbMATH DE number 3656815 (Why is no real title available?)
• scientific article; zbMATH DE number 15339 (Why is no real title available?)
• scientific article; zbMATH DE number 1936673 (Why is no real title available?)
• scientific article; zbMATH DE number 2020227 (Why is no real title available?)
• scientific article; zbMATH DE number 2077079 (Why is no real title available?)
• scientific article; zbMATH DE number 1466304 (Why is no real title available?)
• scientific article; zbMATH DE number 2120365 (Why is no real title available?)
• A lifting and recombination algorithm for rational factorization of sparse polynomials
• A refinement of the Bernštein-Kušnirenko estimate
• Absolute irreducibility of polynomials via Newton polytopes
• Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
• Complexity issues in bivariate polynomial factorization
• Decomposition of polytopes and polynomials
• Factoring bivariate polynomials using adjoints
• Factoring multivariate polynomials via partial differential equations
• Factoring polynomials over global fields
• Factorization of polynomials and some linear-algebra problems over finite fields
• Fast separable factorization and applications
• [[:Publication:3203125|Generalized Newton-Puiseux Theory and Hensel's Lemma in Cx, y]]
• Improving complexity bounds for the computation of Puiseux series over finite fields
• Invariants of hypersurface singularities in positive characteristic
• Invariants of plane curve singularities and Newton diagrams
• Irreducibility criterion for germs of analytic functions of two complex variables
• Irreducibility of multivariate polynomials
• Irreducibility of polynomials modulo \(p\) via Newton polytopes.
• Lifting and recombination techniques for absolute factorization
• New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
• Polyedres de Newton et nombres de Milnor
• Sharp precision in Hensel lifting for bivariate polynomial factorization
• The algebraic closure of the power series field in positive characteristic
• The number of roots of a system of equations

Cited in

(3)

• Factoring bivariate polynomials using adjoints
• Factoring polynomials over function fields
• Computing Puiseux series: a fast divide and conquer algorithm

This page was built for publication: Bivariate factorization using a critical fiber

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