On the computation of minimal polynomials

DOI10.1016/0021-8693(86)90166-3MaRDI QIDQ1080477zbMATH OpenOpenAlexFDO

Authors David R. Richman

Publication date 1986

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-8693(86)90166-3

zbMATH Keywords

epimorphism theoremminimal polynomials

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Relevant commutative algebra (14A05)

Review text

The author describes an algorithm for computing the polynomial p(X,Y) of minimal degree such that \(p(f,g)=0\), where f and g are non-constant polynomials in one indeterminate with the coefficients in a field K with the property that char(K) does not divide the greatest common divisor of deg(f) and deg(g). He also obtains a new and nice proof of the epimorphism theorem of \textit{S. S. Abhyankar} and \textit{T.-t. Moh} [J. Reine Angew. Math. 276, 148-166 (1975; Zbl 0332.14004)] which avoids the appeal to the Newton-Puiseux expansion theorem.

Recommendations

• A Method to Compute Minimal Polynomials
• scientific article; zbMATH DE number 671748
• Computing and using minimal polynomials
• Computing minimal polynomials and the degree of unfaithfulness
• Computing minimal polynomials and the inverse via gcp

Cites work

• A Method to Compute Minimal Polynomials
• scientific article; zbMATH DE number 3427498 (Why is no real title available?)
• scientific article; zbMATH DE number 3130674 (Why is no real title available?)
• scientific article; zbMATH DE number 3518934 (Why is no real title available?)
• On the concept of approximate roots for algebra

Cited in

(15)

• On contractible curves in the complex affine plane
• Computation of Minkowski values of polynomials over complex sets
• Using resultants for SAGBI basis verification in the univariate polynomial ring
• A new proof of the Abhyankar-Moh-Suzuki theorem via a new algorithm for the polynomial dependence
• The epimorphism theorem and its generalizations
• Finding exact minimal polynomial by approximations
• scientific article; zbMATH DE number 6703425 (Why is no real title available?)
• Computing minimal polynomials and the degree of unfaithfulness
• scientific article; zbMATH DE number 5125120 (Why is no real title available?)
• A Method to Compute Minimal Polynomials
• On multivariate minimal polynomials
• scientific article; zbMATH DE number 2109430 (Why is no real title available?)
• scientific article; zbMATH DE number 1390091 (Why is no real title available?)
• On the Newton polyhedron of a Jacobian pair
• scientific article; zbMATH DE number 6319030 (Why is no real title available?)

This page was built for publication: On the computation of minimal polynomials

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