Computing minimal polynomials and the inverse via gcp

DOI10.1080/00927879308824677MaRDI QIDQ5287570zbMATH OpenOpenAlexFDO

Authors 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

degree boundsJacobian conjectureresultantsinversesminimal polynomialsgeneralized 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)

Recommendations

• Computing minimal polynomials and the degree of unfaithfulness
• On relations between Jacobians and minimal polynomials
• A Product Formula for Minimal Polynomials and Degree Bounds for Inverses of Polynomial Automorphisms
• A criterion to decide if a polynomial map is invertible and to compute the inverse

Cites work

• scientific article; zbMATH DE number 17890 (Why is no real title available?)
• A criterion to decide if a polynomial map is invertible and to compute the inverse
• 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

Cited in

(4)

• Computing minimal polynomials and the degree of unfaithfulness
• 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
• On the computation of minimal polynomials

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287570)