The G-biliaison class of symmetric determinantal schemes
Algebraic Geometry
2007-05-23 v4 Commutative Algebra
Abstract
We 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. In particular, it follows that these schemes are glicci. We describe the biliaisons explicitely in the proof of the main theorem.
Cite
@article{arxiv.math/0505414,
title = {The G-biliaison class of symmetric determinantal schemes},
author = {Elisa Gorla},
journal= {arXiv preprint arXiv:math/0505414},
year = {2007}
}
Comments
20 pages, reference addeded, a few mistakes fixed, final version to appear on J. Algebra