English

An Algorithm for Fat Points on P2

Algebraic Geometry 2007-05-23 v2 Commutative Algebra

Abstract

Let FF be a line bundle on the blow-up XX of P2P^2 at rr general points p1,...,prp_1, ..., p_r and let LL be the pullback to XX of the line bundle coming from a line on P2P^2. Under reasonable hypotheses that are conjectured always to hold if the points p1,...,prp_1, ..., p_r are sufficiently general, it is shown that the computation of the dimension of the cokernel of the natural map μF:Γ(F)Γ(L)Γ(FL)\mu_F:\Gamma(F)\otimes\Gamma(L)\to\Gamma(F\otimes L) reduces to the case that FF is ample. As an application, a complete determination of the dimension of the cokernel of μF\mu_F is obtained when r7r\le 7, thereby solving the Ideal Generation Problem for fat point subschemes involving up to 7 general points of the plane and giving an algorithm depending only on the multiplicities mim_i for determining the modules in a minimal free resolution of the ideal defining a fat point subscheme m1p1+...+m7p7m_1p_1+...+ m_7p_7 for general points pip_i. All results hold for an arbitrary algebraically closed ground field kk.

Cite

@article{arxiv.math/9803131,
  title  = {An Algorithm for Fat Points on P2},
  author = {Brian Harbourne},
  journal= {arXiv preprint arXiv:math/9803131},
  year   = {2007}
}

Comments

14 pages; plaintex; improved exposition in introduction; for an on-line implementation of the algorithm, go to http://www.math.unl.edu/~bharbour/cgi-bin/7fatpts.cgi