An Algorithm that Determines whether a Polynomial Map is Bijective

Charles Cheng and Stuart Wang
Additional contact information
Charles Cheng: Oakland University
Stuart Wang: Oakland University

A chapter in Automorphisms of Affine Spaces, 1995, pp 169-176 from Springer

Abstract: Abstract One of the central problems in the study of polynomial maps is the determination of the bijective ones. Although there are many results in the literature on this subject, they can not be used on polynomial maps of high degrees due to memory limitation or the complexity of the algorithm.

Keywords: Characteristic Zero; Inversion Formula; Memory Limitation; Newton Polygon; Apply Algebra (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-8555-2_11

Ordering information: This item can be ordered from
http://www.springer.com/9789401585552

DOI: 10.1007/978-94-015-8555-2_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().