Computing the tight closure in dimension two

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 relations for generators of the ideal to compute its tight closure. In particular, our method gives 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 in , where is a homogeneous polynomial.