全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...
Mathematics  2010 

An Algorithm for Computing the Ratliff-Rush Closure

Full-Text   Cite this paper   Add to My Lib

Abstract:

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.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133