An Algorithm for Fat Points on P2
Abstract
Let be a line bundle on the blow-up of at general points and let be the pullback to of the line bundle coming from a line on . Under reasonable hypotheses that are conjectured always to hold if the points are sufficiently general, it is shown that the computation of the dimension of the cokernel of the natural map reduces to the case that is ample. As an application, a complete determination of the dimension of the cokernel of is obtained when , 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 for determining the modules in a minimal free resolution of the ideal defining a fat point subscheme for general points . All results hold for an arbitrary algebraically closed ground field .
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