Search

Given a finite subgroup G⊂GL(2,ℂ), it is known that the minimal resolution of singularity ℂ2/G is the moduli space Y=G-Hilb(ℂ2) of G-clusters ⊂ℂ2. The explicit description of Y can be obtained by calculating every possible distinguished basis for as vector spaces. These basis are the so-called G-graphs. In this paper we classify G-graphs for any small binary dihedral subgroup G in GL(2,ℂ), and in the context of the special McKay correspondence we use this classification to give a combinatorial description of special representations of G appearing in Y in terms of its maximal normal cyclic subgroup H ⊴ G.

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.

Search Results

Refine search

Refine search

Actions for selected content:

2 results

G-GRAPHS AND SPECIAL REPRESENTATIONS FOR BINARY DIHEDRAL GROUPS IN GL(2,ℂ)

THE G-HILBERT SCHEME FOR

Search Results

Refine search

Refine search

Actions for selected content:

Save Search

2 results

G-GRAPHS AND SPECIAL REPRESENTATIONS FOR BINARY DIHEDRAL GROUPS IN GL(2,ℂ)

THE G-HILBERT SCHEME FOR