On factoring parametric multivariate polynomials
The present paper gives an algorithm for the absolute factorization (factorization over the algebraic closure \(\bar{\mathbb{Q}}\)) of a parametric multivariate polynomial \(F\in \mathbb{Q}[u_1,\dots, u_r][X_0,\dots, X_n]\). The method is a follow-up, with some improvements, of a previous work of the author [Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. 316, 5--29 (2004); translation in J. Math. Sci. 134, 2325--2339 (2006; Zbl 1077.65046)]. Section 1 formalizes the notion of Parametric Absolute Factorization (PAF) of \(F\)\, and stated the main result (theorem 1.5): it is possible to find a finite number of PAFs whose constructible sets form a partition of the parameters space \(\mathcal{P}=\bar{\mathbb{Q}}^r\). Section 2 gathers some necessary tools: Hensel's lemma, the Chistov-Grigoriev method for quantifier elimination [\textit{A. L. Chistov} and \textit{D. Yu. Grigorie}, Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 17--31 (1984; Zbl 0562.03015)] and an algorithm of the author of the present paper for solving zero-dimensional parametric polynomial systems [PhD Thesis, University of Rennes 1, France (2006)]. The proposed algorithm is detailed in the section 3. Theorem 3.19 includes Theorem 1.5 and gives also bounds for the number of necessary PAFs and the computational complexity of the algorithm.
- Complexity bound for the absolute factorization of parametric polynomials
- Complexity of solving parametric polynomial systems
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- On computing absolutely irreducible components of algebraic varieties with parameters
- Efficient absolute factorization of polynomials with parametric coefficients
- An algorithm for solving zero-dimensional parametric systems of polynomial homogeneous equations
- A lecture on the complexity of factoring polynomials over global fields
- scientific article; zbMATH DE number 2151216
- scientific article; zbMATH DE number 1490034
- Comprehensive Triangular Decomposition
- A new algorithm for discussing Gröbner bases with parameters.
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Algorithms in real algebraic geometry
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 3895043 (Why is no real title available?)
- On Hensel factorization. I
- Complexity of solving parametric polynomial systems
- Efficient absolute factorization of polynomials with parametric coefficients
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Generating approximate parametric roots of parametric polynomials
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- A lecture on the complexity of factoring polynomials over global fields
- scientific article; zbMATH DE number 3997161 (Why is no real title available?)
- Complexity bound for the absolute factorization of parametric polynomials
- Four lectures on polynomial absolute factorization
- Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions
- On computing absolutely irreducible components of algebraic varieties with parameters
- On factorization of parametric polynomials
This page was built for publication: On factoring parametric multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1958945)
