Papers
Topics
Authors
Recent
Search
2000 character limit reached

The T-graph of a multigraded Hilbert scheme

Published 9 Oct 2011 in math.AG | (1110.1861v1)

Abstract: The T-graph of a multigraded Hilbert scheme records the zero and one-dimensional orbits of the T = (K*)n action on the Hilbert scheme induced from the T-action on An. It has vertices the T-fixed points, and edges the one-dimensional T-orbits. We give a combinatorial necessary condition for the existence of an edge between two vertices in this graph. For the Hilbert scheme of points in the plane, we give an explicit combinatorial description of the equations defining the scheme parameterizing all one-dimensional torus orbits whose closures contain two given monomial ideals. For this Hilbert scheme we show that the T-graph depends on the ground field, resolving a question of Altmann and Sturmfels.

Summary

Paper to Video (Beta)

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 (2)

Collections

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