The G-biliaison class of symmetric determinantal schemes

AbstractWe consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them. We show that these schemes are G-bilinked to a linear variety of the same dimension. In particular, they can be obtained from a linear variety by a finite sequence of ascending G-biliaisons on some determinantal schemes. We describe the biliaisons explicitly in the proof of Theorem 2.3. In particular, it follows that these schemes are glicci