Homogeneous polynomial ideals: Standard bases and liaison (Q752769)

Let \(R=k[X,Y,Z_ 1,...,Z_ r]\) and I be a perfect homogeneous ideal of height two. The author axiomatizes properties of combinatorial data associated to I, including the Hilbert function, the number of minimal generators in each degree, and the least index such that \(I_ tR\) has grade at least two. A collection \({\mathcal C}\) that satisfies these properties is called permissible, and trivial if it corresponds to a complete intersection. If F, G is a regular sequence of forms in I with smallest possible degrees, then \(J=(F,G):I\) is a minimal link of I. The data \({\mathcal C}_ I\) and \({\mathcal C}_ J\) are closely related; hence one can define minimal linkage of data sets abstractly. The main result is that every minimally linked sequence \({\mathcal C}^{(m)},...,{\mathcal C}^{(0)}\) of permissible data sets can be realized by a minimally linked sequence of monomial ideals, and if one takes \({\mathcal C}^{(0)}\) to be trivial then the minimal generating sets can be constructed algorithmically. If \(r\geq 1\) and k is infinite, then for any permissible \({\mathcal C}\) there is an ideal I so that \({\mathcal C}={\mathcal C}_ I\) and R/I is reduced.