2010/01/13 by Oskar Kędzierski, Kedzierski, Oskar · 1 citation
Mathematics · #14C05 #14E14 #Advanced Topics in Algebra #Algebraic Geometry (math.AG) #Algebraic structures and combinatorial models #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research
paper · pdf · doi:10.48550/arxiv.1001.2193
openalex publication_date 2010/01/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 C3 with weights 1,a,r-a. We describe how the combinatorial properties of the fan of G-Hilbert scheme relates to the Euclidean algorithm.