An Algorithm for Computing the Ratliff-Rush Closure

Details An Algorithm for Computing the Ratliff-Rush Closure An Algorithm for Computing the Ratliff-Rush Closure

2010-09-03

arxiv.org/abs/1009.0788v1

Mathematics

Commutative Algebra

Scientific paper

Let I\subset 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 \cite{Cri}. Also, it provides generalizations and answers for some questions given in \cite{HJLS}, and enables us to construct infinite families of Ratliff-Rush ideals.

Affiliated with

Also associated with

No associations

Rating

An Algorithm for Computing the Ratliff-Rush Closure does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Algorithm for Computing the Ratliff-Rush Closure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Algorithm for Computing the Ratliff-Rush Closure will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284481