Computing minimal polynomials and the degree of unfaithfulness

DOI10.1080/00927879308824749zbMATH Open0791.13010OpenAlexW1975582391MaRDI QIDQ3136856FDOQ3136856

Authors: Wei Li, Jie-Tai Yu 

Publication date: 6 October 1993

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

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

Recommendations

• Computing minimal polynomials and the inverse via gcp
• Computing minimal polynomial of matrices over algebraic extension fields
• Computing and using minimal polynomials
• On the computation of minimal polynomials
• scientific article; zbMATH DE number 3998208

zbMATH Keywords

minimal polynomialbirationalityGröbner basisautomorphism of polynomial rings

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Birational automorphisms, Cremona group and generalizations (14E07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the unboundedness of generators of prime ideals in powerseries rings of three variables
• An inversion formula for two polynomials in two variables
• A criterion to decide if a polynomial map is invertible and to compute the inverse
• Face polynomials and inversion formula

Cited In (7)

• Title not available (Why is that?)
• A Product Formula for Minimal Polynomials and Degree Bounds for Inverses of Polynomial Automorphisms
• Title not available (Why is that?)
• Remarks on the Jacobian conjecture
• The structure of the honest polynomial m-degrees
• On relations between Jacobians and minimal polynomials
• On the computation of minimal polynomials

This page was built for publication: Computing minimal polynomials and the degree of unfaithfulness

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