| Algorithms for recognizing coordinates in two variables over UFD's |
| Full text |
Pdf
(162 KB)
|
| Source
|
International Conference on Symbolic and Algebraic Computation
archive
Proceedings of the 2004 international symposium on Symbolic and algebraic computation
table of contents
Santander, Spain
Pages: 135 - 140
Year of Publication: 2004
ISBN:1-58113-827-X
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 4, Citation Count: 0
|
|
|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
S. S. Abhyankar and T. T. Moh. Embeddings of the line in the plane. J. Reine Angew. Math., 276:148--166, 1975.
|
| |
2
|
|
| |
3
|
A. Campbell and J-T. Yu. Two dimensional coordinate polynomials and dominant maps. Comm. Algebra, 28(5):2297--2301, 2000.
|
| |
4
|
J. Chadzyński and T. Krasiński. On the Lojasiewicz exponent at infinity for polynomial mappings of C2 into C2 and components of polynomial automorphisms of C2. Ann. Pol. Math. Soc., 57(3):291--302, 1992.
|
| |
5
|
C. C. Cheng, J. H. McKay, and S. S-S. Wang. Younger mates and the Jacobian Conjecture. Proc. Amer. Math. Soc., 123(10):2939--2947, 1995.
|
| |
6
|
A. Van den Essen. Polynomial Automorphisms and the Jacobian Conjecture, volume 190 in Progress in Math. Birkhauser, Besel, 2000.
|
| |
7
|
Eric Edo and Stéphane Vénéreau. Length 2 variables of a{x; y} and transfer. Proceedings of Krakow Conference on polynomial automorphism, Annales Polonici Mathematici 2001. LXXVI.1-2.
|
| |
8
|
A. van den Essen. Locally nilpotent derivations and their applications III. J. Pure and applied Algebra, 98:15--23, 1995.
|
| |
9
|
A. van den Essen and P. van Rossum. Coordinates in two variables over Q-algebras. to be found, 2000.
|
| |
10
|
J. H. McKay and S. S-S. Wang. An elementary proof of the automorphism theorem for the polynomial ring in two variables. J. Pure Appl. Algebra, 52:91--102, 1988.
|
| |
11
|
V. Shpilrain and J-T. Yu. Polynomial automorphisms and Gröbner reductions. J. Algebra, 197:546--558, 1997.
|
| |
12
|
D. L. Wright. On the Jacobian Conjecture. Illinois J. Math, 25(3):423--440, 1981.
|
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|