AN ALGORITHM FOR COMPUTING THE RATLIFF-RUSH CLOSURE

被引:9
作者
Al-Ayyoub, Ibrahim [1 ]
机构
[1] Jordan Univ Sci & Technol, Dept Math & Stat, Irbid 22110, Jordan
关键词
Ratliff-Rush closure; monomial ideals; reductions of ideals; Ratliff-Rush filtration; graded associated ring; GRADED RING; IDEALS;
D O I
10.1142/S0219498809003473
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let I subset of K[x, y] be a < x, y >- primary monomial ideal where K is a field. This paper produces an algorithm for computing the Ratliff-Rush closure (I) over tilde for the ideal I = < m(0),..., m(n)> whenever mi is contained in the integral closure of the ideal < x(an), y(b0)>. This generalizes of the work of Crispin [2]. Also, it provides generalizations and answers for some questions given in [6], and enables us to construct infinite families of Ratliff-Rush ideals.
引用
收藏
页码:521 / 532
页数:12
相关论文
共 11 条