Algorithms for polynomials in two variables
| dc.creator | Neumann, Walter D. | |
| dc.creator | Wightwick, Penelope G. | |
| dc.date | 1999-11-15 | |
| dc.date.accessioned | 2026-07-07T05:31:36Z | |
| dc.date.available | 2026-07-07T05:31:36Z | |
| dc.description | 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]. | |
| dc.description | Written for Proceedings of the Conference on Combinatorial and Computational Algebra, Hong Kong, May 1999 | |
| dc.identifier | https://arxiv.org/abs/math/9911104 | |
| dc.identifier | http://arxiv.org/abs/math/9911104 | |
| dc.identifier | "Combinatorial and Computational Algebra", Chan, Mikhalev, Siu, Yu, Zelmanov, eds., Contemporary Math. 264 (2000), 219--235. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79407 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 14E09; 14E35 | |
| dc.title | Algorithms for polynomials in two variables | |
| dc.type | text |