Extractions: Computable and Visible Analogues of Localizations for Polynomial Ideals
Ye Liang

TL;DR
This paper introduces the extraction operation for polynomial ideals, providing a computable, geometric analogue of localization that simplifies analyzing local properties without full primary decomposition.
Contribution
It defines extraction as a new ideal operation that captures local geometric features and can be computed using standard basis methods, bridging the gap between algebraic and geometric localizations.
Findings
Extraction retains geometric meaning in polynomial rings.
Extraction can be computed without primary decomposition.
Extraction is as powerful as localization for polynomial ideals.
Abstract
When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the other hand, the standard basis method is very effective for the computation in a special kind of localized rings, but for a general semigroup order the geometry of the localization of a positive-dimensional ideal is difficult to interpret. In this paper, we introduce a new ideal operation called extraction. For an ideal in a polynomial ring over a field , we use another ideal to control the primary components of and the result is called the extraction of by . It is still a polynomial ideal and has a concrete geometric meaning in , i.e., we keep the branches of $\textbf{V}(I) \subset…
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
TopicsPolynomial and algebraic computation · Commutative Algebra and Its Applications · Advanced Numerical Analysis Techniques
