Computing the tight closure in dimension two

Details Computing the tight closure in dimension two Computing the tight closure in dimension two

2003-03-10

arxiv.org/abs/math/0303116v2

Mathematics

Commutative Algebra

Some minor changes. To appear in Mathematics of Computations

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing the tight closure in dimension two 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 Computing the tight closure in dimension two, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing the tight closure in dimension two will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284068