Papers
Topics
Authors
Recent
Search
2000 character limit reached

Connected Components in the Hilbert Scheme of hypersurfaces in Grassmannians

Published 15 Jul 2019 in math.AG | (1907.06569v2)

Abstract: We show that when $d \geq 3$, the Hilbert scheme $Hilb_{dT+1-\binom{d-1}{2}}(G(k,n))$ has 2 components, even though elements in both components have the same cohomology class. Moreover, we show that the Hilbert scheme associated to the Hilbert polynomial $\binom{T+n}{n}-\binom{T+n-d}{n}$ in Grassmannian has at most 2 connected components.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.