The T-Graph of a Multigraded Hilbert Scheme


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 A. It has vertices the T -fixed points, and edges the onedimensional T -orbits. We give a combinatorial necessary condition for the existence of an edge between two vertices in this graph. For… (More)
DOI: 10.1080/10586458.2012.659569


6 Figures and Tables