Equivalence of polynomials under automor
β
Penelope G. Wightwick
π
Article
π
2001
π
Elsevier Science
π
English
β 323 KB
We provide an e ective and e cient algorithm to decide, given two polynomials in p; q β C[x; y], whether there is an automorphism of C[x; y] taking p to q, and to ΓΏnd this automorphism if it exists. For p(x; y) = x an algorithm is implicit in the proofs of the Abhyankar-Moh=Suzuki embedding theorem,