The G-biliaison class of symmetric determinantal schemes
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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.