A new proof of the Abhyankar–Moh–Suzuki theorem via a new algorithm for the polynomial dependence

DOI10.1142/S0219498815400010zbMath1327.13091arXiv1212.0163OpenAlexW2038762929MaRDI QIDQ2947364

Leonid G. Makar-Limanov

Publication date: 22 September 2015

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.0163

zbMATH Keywords

Abhyankar-Moh-Suzuki theoremdegree semigroupminimal polynomial dependence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials and finite commutative rings (13M10) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items

The epimorphism theorem and its generalizations ⋮ The Jacobian Conjecture, Together with Specht and Burnside-Type Problems ⋮ On the Newton polyhedron of a Jacobian pair

Cites Work

• On two fundamental theorems for the concept of approximate roots
• On the computation of minimal polynomials
• On contractible curves in the complex affine plane
• Propriétés topologiques des polynômes de deux variables complexes et automorphismes algébriques de l'espace \(C^2\)
• A new topological proof of the Abhyankar-Moh theorem
• A new proof of the Abhyankar-Moh-Suzuki theorem
• A Method to Compute Minimal Polynomials
• On Abhyankar-Moh's Epimorphism Theorem
• Poisson brackets and two-generated subalgebras of rings of polynomials