Polynomial decomposition algorithms

Authors:
David R. Barton;Richard Zippel
Affiliations:
Mathematics Department, University of California, Berkeley, California 94720, U.S.A.;Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1985

Citing 2
Cited 20

Completing nth powers of polynomials

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
A polynomial decomposition algorithm

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

Polynomial decomposition algorithms

Journal of Symbolic Computation
Functional decomposition ofpolynomials: the tame case

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Functional decomposition of polynomials: The wild case

Journal of Symbolic Computation
Rational function decomposition

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
A practical implementation of two rational function decomposition algorithms

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Approximate polynomial decomposition

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
An Algorithm for Nonparametric Decomposition of Differential Polynomials

Programming and Computing Software
Cited References

Computer algebra handbook
Decomposition of differential polynomials with constant coefficients

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On the decomposition of rational functions

Journal of Symbolic Computation
Functional decomposition of polynomials

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
High order derivatives and decomposition of multivariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Algebraic Condition for Decomposition of Large-Scale Linear Dynamic Systems

International Journal of Applied Mathematics and Computer Science
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem

Journal of Complexity
Composition collisions and projective polynomials: statement of results

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Decomposition of generic multivariate polynomials

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
An algorithm for the decomposition of differential polynomials in the general case

Programming and Computing Software
Timesharing dexter

Logic and Program Semantics
Lower bounds for decomposable univariate wild polynomials

Journal of Symbolic Computation
Compositions and collisions at degree p 2

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following problem : given a polynomial f(x) @? k[x], k a field, find a complete decomposition of f in the form f= g"1^^og"2^^o^.^.^.^^og"nwhere ^o denotes functional composition . After reviewing some known results about existence and uniqueness of such decompositions two algorithms are presented that solve the decomposition problem.