Algorithms for polynomials in two variables

Details Algorithms for polynomials in two variables Algorithms for polynomials in two variables

1999-11-15

arxiv.org/abs/math/9911104v1

"Combinatorial and Computational Algebra", Chan, Mikhalev, Siu, Yu, Zelmanov, eds., Contemporary Math. 264 (2000), 219--235.

Mathematics

Algebraic Geometry

Written for Proceedings of the Conference on Combinatorial and Computational Algebra, Hong Kong, May 1999

Scientific paper

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the automorphism if it exists. The algorithm is due to the second author, who described it in terms of Newton polygons, with C replaceable by a field of any characteristic. Here we describe it in terms of splice diagrams, which gains some efficiency at cost of generality (it currently applies only to characteristic zero). Part of the purpose of this paper is to give an exposition of the use of splice diagrams in studying C[x,y].

Affiliated with

Also associated with

No associations

Rating

Algorithms for polynomials in two variables does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithms for polynomials in two variables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for polynomials in two variables will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-637164