Algorithms for polynomials in two variables

MaRDI QIDQ2704370zbMATH OpenFDO

Authors Walter D. Neumann, Penelope G. Wightwick

Publication date 27 August 2003

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

zbMATH Keywords

splice diagrameffective algorithmautomorphism of polynomial ring

Mathematics Subject Classification ID

Plane and space curves (14H50) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)

Recommendations

• Equivalence of polynomials under automorphisms of \(\mathbb{C}^2\)
• Tame and wild coordinates of \(\mathbb Z[x,y]\).
• AUTOMORPHIC EQUIVALENCE PROBLEM FOR FREE ASSOCIATIVE ALGEBRAS OF RANK TWO
• Equivalence of polynomials under automorphisms of \(K[x,y]\)
• Automorphisms of the \(k\)-algebra \(k[X_1, \ldots, X_m]\)

Cited in

(6)

• Algorithmic Polynomials
• Algorithmic polynomials
• Equivalence of polynomials under automorphisms of \(\mathbb{C}^2\)
• scientific article; zbMATH DE number 1929311 (Why is no real title available?)
• Variation on Euclid's algorithm for polynomials
• An algorithm to find a coordinate's mate

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Algorithms for polynomials in two variables

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