Decomposition of polynomials and approximate roots
From MaRDI portal
Abstract: We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is the approximate d-root of P. Moreover we give an algorithm to compute such a decomposition. We apply these results to decide whether a polynomial in one or several variables is decomposable or not.
Recommendations
Cites work
- Composition factors of polynomials
- Functional decomposition of polynomials: the tame case
- scientific article; zbMATH DE number 3427498 (Why is no real title available?)
- scientific article; zbMATH DE number 3518934 (Why is no real title available?)
- scientific article; zbMATH DE number 2020240 (Why is no real title available?)
- scientific article; zbMATH DE number 1467743 (Why is no real title available?)
- Indecomposable polynomials and their spectrum
- Necessary Conditions for Polynomial Solutions of Certain Riccati Equations
- Polynomial decomposition algorithms
Cited in
(7)- Decomposition of the infinite companion and interpolation
- Composite values of polynomial power sums
- New algorithms for exact and approximate polynomial decomposition
- Waring's problem for polynomials in two variables
- When Does F(αd) = F(α)?
- Perfect powers in polynomial power sums
- Specializations of indecomposable polynomials
This page was built for publication: Decomposition of polynomials and approximate roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3566659)