Dimension of Families of Determinantal Schemes
Abstract
A scheme of codimension is called {\em standard determinantal} if its homogeneous saturated ideal can be generated by the maximal minors of a homogeneous matrix and is said to be {\em good determinantal} if it is standard determinantal and a generic complete intersection. Given integers and we denote by (resp. ) the locus of good (resp. standard) determinantal schemes of codimension defined by the maximal minors of a matrix where is a homogeneous polynomial of degree . In this paper we address the following three fundamental problems : To determine (1) the dimension of (resp. ) in terms of and , (2) whether the closure of is an irreducible component of , and (3) when is generically smooth along . Concerning question (1) we give an upper bound for the dimension of (resp. ) which works for all integers and , and we conjecture that this bound is sharp. The conjecture is proved for , and for under some restriction on and . For questions (2) and (3) we have an affirmative answer for and , and for under certain numerical assumptions.
Keywords
Cite
@article{arxiv.math/0209011,
title = {Dimension of Families of Determinantal Schemes},
author = {Jan O. Kleppe and Rosa M. Miro-Roig},
journal= {arXiv preprint arXiv:math/0209011},
year = {2007}
}
Comments
37 pages