Borel open covering of Hilbert schemes

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This version contains and extends the second part of the previous one. A new extended version of the first part, with some new

Scientific paper

Let p(t) be an admissible Hilbert polynomial in P^n of degree d. It is well known that the Hilbert scheme Hilb_p(t)^n can be seen as a closed subscheme of a Grassmannian, hence, by Plucker embedding, it becomes a closed subset of a suitable projective space P^E. Unluckily, the dimension E of this projective space is generally huge, so effective computations are practically impossible. In this paper, we exhibit an open covering of Hilb_p(t)^n, defined from monomial Borel ideals, made up of "few" open subsets. We prove that each open subset of the covering can be embedded in an affine space of dimension far lower than E using equations of degree <=d+2; furthermore, with no more bound on the degree of the equations, we show that each open subset can be embedded into a linear subspace of even lower dimension. The proofs are constructive and use a polynomial reduction process: it is similar to the one for Groebner bases, but term order free. So in this setting, explicit computations are achievable in many non-trivial cases.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Borel open covering of Hilbert schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Borel open covering of Hilbert schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Borel open covering of Hilbert schemes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-428389

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.