arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0303116math.ACmath.AG
收藏

Computing the tight closure in dimension two

Holger Brenner

英文摘要:

We study computational aspects of the tight closure of a homogeneous primary ideal in a two-dimensional normal standard-graded domain. We show how to use slope criteria for the sheaf of syzygies for generators of the ideal to compute the tight closure. Our method gives in particular an algorithm to compute the tight closure of three elements under the condition that we are able to compute the Harder-Narasimhan filtration. We apply this to the computation of (x^a,y^a,z^a)^* in K[x,y,z]/(F), where F is a homogeneous polynomial.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑