An Algorithm for Computing the Ratliff-Rush Closure

2010/09/03 by Al-Ayyoub, Ibrahim
#13P10 #Commutative Algebra (math.AC) #FOS: Mathematics

paper · doi:10.48550/arxiv.1009.0788

Abstract

Let I⊂ K[x,y] be a -primary monomial ideal where K is a field. This paper produces an algorithm for computing the Ratliff-Rush closure I for the ideal I= whenever m_i is contained in the integral closure of the ideal . This generalizes of the work of Crispin \citeCri. Also, it provides generalizations and answers for some questions given in \citeHJLS, and enables us to construct infinite families of Ratliff-Rush ideals.

Related

• The Ratliff-Rush Closure of Initial Ideals of Certain Prime Ideals
• Ratliff-Rush Closure of Ideals in Integral Domains
• Powers of monomial ideals and the Ratliff-Rush operation
• Results on the Ratliff-Rush Closure and the Integral Closedness of Powers of Certain Monomial Curves
• On the computation of Ratliff-Rush closure