AN ALGORITHM FOR COMPUTING THE RATLIFF–RUSH CLOSURE
From MaRDI portal
Publication:3638688
DOI10.1142/S0219498809003473zbMath1174.13011arXiv1009.0788OpenAlexW2963886293MaRDI QIDQ3638688
Publication date: 28 October 2009
Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.0788
monomial idealsRatliff-Rush filtrationreductions of idealsRatliff-Rush closuregraded associated ring
Related Items (9)
On the reduction numbers of monomial ideals ⋮ Freiman ideals and the number of generators of powers of monomial ideals ⋮ A note on the ascending chain condition of ideals ⋮ Results on the behavior of the Ratliff–Rush operation and the depth of the associated graded ring ⋮ The Ratliff-Rush closure of initial ideals of certain prime ideals ⋮ Monomial ideals with tiny squares and Freiman ideals ⋮ Results on the Ratliff–Rush Closure and the Integral Closedness of Powers of Certain Monomial Curves ⋮ Powers of monomial ideals and the Ratliff-Rush operation ⋮ Powers of monomial ideals and the Ratliff-Rush operation
Cites Work
This page was built for publication: AN ALGORITHM FOR COMPUTING THE RATLIFF–RUSH CLOSURE