An Alternative Approach to Polynomial Mappings
Yongbi Li
TL;DR
This paper introduces a new method to simplify proofs of key results in polynomial mappings within Computational Algebraic Geometry, focusing on implicitization, image closure, and ideal relations.
Contribution
It proposes an alternative approach that streamlines proofs of fundamental theorems in polynomial mappings, enhancing understanding and efficiency.
Findings
Simplified proofs of polynomial implicitization
Clarified properties of image closure
Improved understanding of ideal relations
Abstract
This paper presents an alternative approach to simplify the proofs of some important results related to polynomial mappings in Computational Algebraic Geometry such as Polynomial Implicitization, Image Closure and some properties of the ideal relations of polynomial mappings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Differential Equations and Dynamical Systems