Effective Localization Using Double Ideal Quotient and Its Implementation

摘要

In this paper, we propose a new method for localization of polynomial ideal, which we call "Local Primary Algorithm". For an ideal I and a prime ideal P, our method computes a P-primary component of I after checking if P is associated with I by using double ideal quotient (I : (I : P)) and its variants which give us a lot of information about localization of I.