The G-Hilbert scheme for 1/r(1,a,r-a)
Algebraic Geometry
2010-06-16 v2 Combinatorics
Abstract
Following Craw, Maclagan, Thomas and Nakamura's work on Hilbert schemes for abelian groups, we give an explicit description of the G-Hilbert scheme for G equal to a cyclic group of order r, acting on C^3 with weights 1,a,r-a. We describe how the combinatorial properties of the fan of G-Hilbert scheme relates to the Euclidean algorithm.
Cite
@article{arxiv.1001.2193,
title = {The G-Hilbert scheme for 1/r(1,a,r-a)},
author = {Oskar Kedzierski},
journal= {arXiv preprint arXiv:1001.2193},
year = {2010}
}
Comments
17 pages, 1 figure; to appear in Glasgow Mathematical Journal