McKay trees
نویسندگان
چکیده
Given a finite group G and its representation ρ, the corresponding McKay graph is Γ(G,ρ) whose vertices are irreducible representations of G; number edges between two π,τ dimHom (π⊗ρ,τ). The collection all graphs for given encodes, in sense, character table. Such were also used by to provide bijection subgroups SU(2) affine Dynkin diagrams types A,D,E, considering appropriate graphs.
منابع مشابه
Mckay Correspondence
1 Introduction Conjecture 1.1 (since 1992) G ⊂ SL(n, C) is a finite subgroup. Assume that the quotient X = C n /G has a crepant resolution f : Y → X (this just means that K Y = 0, so that Y is a " noncompact Calabi–Yau manifold "). Then there exist " natural " bijections {irreducible representations of G} → basis of H * (Y, Z) (1) {conjugacy classes of G} → basis of H * (Y, Z) (2) As a slogan "...
متن کاملArithmetic Mckay Correspondence
We propose an arithmetic McKay correspondence which relates suitably defined zeta functions of some Deligne-Mumford stacks to the zeta functions of their crepant resolutions. Some examples are discussed.
متن کاملThe Mckay Correspondence
The McKay correspondence gives a bijection between the finite subgroups of SU(2) and the affine simply laced Dynkin diagrams. In particular, this bijection associates naturally to each finite dimensional representation of SU(2) a vertex of the corresponding diagram. The goal of this talk will be to construct this correspondence and to discuss some proofs and generalizations.
متن کاملGodsil-McKay switching and isomorphism
Godsil-McKay switching is an operation on graphs that doesn’t change the spectrum of the adjacency matrix. Usually (but not always) the obtained graph is non-isomorphic with the original graph. We present a straightforward sufficient condition for being isomorphic after switching, and give examples which show that this condition is not necessary. For some graph products we obtain sufficient con...
متن کاملMcKay Correspondence for Canonical Orders
Canonical orders, introduced in the minimal model program for orders [CI05], are simultaneous generalisations of Kleinian singularities k[[s, t]], G < SL2 and their associated skew group rings k[[s, t]]∗G. In this paper, we construct minimal resolutions of canonical orders via non-commutative cyclic covers and skew group rings. This allows us to exhibit a derived equivalence between minimal res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2023
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.270