Computing minimal polynomials and the inverse via gcp

DOI10.1080/00927879308824677zbMath0792.12001OpenAlexW2058122459MaRDI QIDQ5287570

Jie-Tai Yu

Publication date: 17 August 1993

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927879308824677

zbMATH Keywords

resultantsinversesJacobian conjectureminimal polynomialsdegree boundsgeneralized characteristic polynomialsexplicit inversion formulas

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Polynomials over commutative rings (13B25) Real and complex fields (12D99)

Related Items (2)

ON RESULTANT CRITERIA AND FORMULAS FOR THE INVERSION OF A POLYNOMIAL MAP ⋮ A Product Formula for Minimal Polynomials and Degree Bounds for Inverses of Polynomial Automorphisms

Cites Work

• Unnamed Item
• A resultant criterion and formula for the inversion of a polynomial map in two variables
• The Jacobian conjecture: Reduction of degree and formal expansion of the inverse
• A criterion to decide if a polynomial map is invertible and to compute the inverse

This page was built for publication: Computing minimal polynomials and the inverse via gcp