论文信息 - Algorithms for recognizing coordinates in two variables over UFD's

Algorithms for recognizing coordinates in two variables over UFD's

We give an easy and efficient algorithm to check whether a given polynomial f in K[x,y] is a coordinate, where K be a commutative field of characteristic zero, and if so to compute a coordinate's mate of f. Then we treat the same problem replacing the ground field K by a unique factorization domain A of characteristic zero. A notable feature of our method is that it always produces a mate of minimum degree.

M'hammed El Kahoui | Hassan El Houari | M. E. Kahoui | H. E. Houari

[1] E. Edo,et al. Length 2 variables of A[x,y] and transfer , 2001 .

[2] Lee Rudolph,et al. Embeddings of the line in the plane. , 1982 .

[3] A. V. D. Essen,et al. Polynomial Automorphisms and the Jacobian Conjecture , 2000, Frontiers in Mathematics.

[4] On the Łojasiewicz exponent at infinity for polynomial mappings of ℂ² into ℂ² and components of polynomial automorphisms of ℂ² , 1992 .

[5] Joost Berson,et al. An algorithm to find a coordinate's mate , 2003, J. Symb. Comput..

[6] Jietai Yu,et al. Two dimensional coordinate polynomials and dominant maps , 2000 .

[7] David Wright,et al. On the Jacobian conjecture , 1981 .

[8] J. H. Mckay,et al. An elementary proof of the automorphism theorem for the polynomial ring in two variables , 1988 .

[9] V. Shpilrain,et al. Polynomial Automorphisms and Gröbner Reductions , 1997 .

[10] A. Essen. Locally nilpotent derivations and their applications, III , 1995 .

[11] P. Rossum,et al. Coordinates in two variables over a Q-algebra , 2004 .