Article contents
THE G-HILBERT SCHEME FOR
Published online by Cambridge University Press: 25 August 2010
Abstract
Following Craw, Maclagan, Thomas and Nakamura's works[2, 7] on Hilbert schemes for abelian groups, we give an explicit description of theHilbGℂ3 scheme for G = 〈diag(ϵ, ϵa, ϵr−a)〉 by a classification of all G-sets. We describe how the combinatorial properties of the fan of HilbGℂ3 relates to the Euclidean algorithm.
Keywords
- Type
- Research Article
- Information
- Copyright
- Copyright © Glasgow Mathematical Journal Trust 2010
References
REFERENCES
- 1
- Cited by