The inverse of an automorphism in polynomial time
- 1 January 1989
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The first known polynomial-time algorithm for computing the inverse of a K-algebra automorphism is presented. The algorithm works over a commutative ring K and is based on a polynomial decomposition algorithm. A polynomial-time algorithm for computing the left composition factor of a multivariate decomposition is also presented. Two related open problems are stated.Keywords
This publication has 7 references indexed in Scilit:
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1989
- Polynomial decomposition algorithmsJournal of Symbolic Computation, 1985
- Automorphisms of polynomial and power series ringsJournal of Pure and Applied Algebra, 1983
- The Jacobian conjecture: Reduction of degree and formal expansion of the inverseBulletin of the American Mathematical Society, 1982
- A condition for a polynomial map to be invertibleMathematische Annalen, 1973
- Ganze Cremona-TransformationenMonatshefte für Mathematik, 1939
- Prime and composite polynomialsTransactions of the American Mathematical Society, 1922