Svoboda | Graniru | BBC Russia | Golosameriki | Facebook

To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

From Wikipedia, the free encyclopedia


Affine (extended) Dynkin diagrams

In mathematics, the McKay graph of a finite-dimensional representation V of a finite group G is a weighted quiver encoding the structure of the representation theory of G. Each node represents an irreducible representation of G. If χ i, χ j are irreducible representations of G, then there is an arrow from χ i to χ j if and only if χ j is a constituent of the tensor product Then the weight nij of the arrow is the number of times this constituent appears in For finite subgroups H of the McKay graph of H is the McKay graph of the defining 2-dimensional representation of H.

If G has n irreducible characters, then the Cartan matrix cV of the representation V of dimension d is defined by where δ is the Kronecker delta. A result by Robert Steinberg states that if g is a representative of a conjugacy class of G, then the vectors are the eigenvectors of cV to the eigenvalues where χV is the character of the representation V.[1]

The McKay correspondence, named after John McKay, states that there is a one-to-one correspondence between the McKay graphs of the finite subgroups of and the extended Dynkin diagrams, which appear in the ADE classification of the simple Lie algebras.[2]

YouTube Encyclopedic

  • 1/5
    Views:
    64 488
    4 487
    672
    550
    303
  • EquatIO® for Google Introduction
  • EquatIO® for Google: How to Use in Google Docs
  • ICM2014 VideoSeries LC12: Georgia Benkart on Aug14Thu
  • Idun Reiten, McKay Correspondence and Higher Auslander and Preprojective Algebras
  • Discrete Mathematics #27 Graph Theory: Ramsey Problem (2/2)

Transcription

Definition

Let G be a finite group, V be a representation of G and χ be its character. Let be the irreducible representations of G. If

then define the McKay graph ΓG of G, relative to V, as follows:

  • Each irreducible representation of G corresponds to a node in ΓG.
  • If nij > 0, there is an arrow from χ i to χ j of weight nij, written as or sometimes as nij unlabeled arrows.
  • If we denote the two opposite arrows between χ i, χ j as an undirected edge of weight nij. Moreover, if we omit the weight label.

We can calculate the value of nij using inner product on characters:

The McKay graph of a finite subgroup of is defined to be the McKay graph of its canonical representation.

For finite subgroups of the canonical representation on is self-dual, so for all i, j. Thus, the McKay graph of finite subgroups of is undirected.

In fact, by the McKay correspondence, there is a one-to-one correspondence between the finite subgroups of and the extended Coxeter-Dynkin diagrams of type A-D-E.

We define the Cartan matrix cV of V as follows:

where δij is the Kronecker delta.

Some results

  • If the representation V is faithful, then every irreducible representation is contained in some tensor power and the McKay graph of V is connected.
  • The McKay graph of a finite subgroup of has no self-loops, that is, for all i.
  • The arrows of the McKay graph of a finite subgroup of are all of weight one.

Examples

  • Suppose G = A × B, and there are canonical irreducible representations cA, cB of A, B respectively. If χ i, i = 1, …, k, are the irreducible representations of A and ψ j, j = 1, …, , are the irreducible representations of B, then
are the irreducible representations of A × B, where In this case, we have
Therefore, there is an arrow in the McKay graph of G between and if and only if there is an arrow in the McKay graph of A between χi, χk and there is an arrow in the McKay graph of B between ψ j, ψ. In this case, the weight on the arrow in the McKay graph of G is the product of the weights of the two corresponding arrows in the McKay graphs of A and B.
  • Felix Klein proved that the finite subgroups of are the binary polyhedral groups; all are conjugate to subgroups of The McKay correspondence states that there is a one-to-one correspondence between the McKay graphs of these binary polyhedral groups and the extended Dynkin diagrams. For example, the binary tetrahedral group is generated by the matrices:
where ε is a primitive eighth root of unity. In fact, we have
The conjugacy classes of are:
The character table of is
Conjugacy Classes
Here The canonical representation V is here denoted by c. Using the inner product, we find that the McKay graph of is the extended Coxeter–Dynkin diagram of type

See also

References

  1. ^ Steinberg, Robert (1985), "Subgroups of , Dynkin diagrams and affine Coxeter elements", Pacific Journal of Mathematics, 18: 587–598, doi:10.2140/pjm.1985.118.587
  2. ^ McKay, John (1982), "Representations and Coxeter Graphs", "The Geometric Vein", Coxeter Festschrift, Berlin: Springer-Verlag

Further reading

This page was last edited on 21 March 2024, at 06:33
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.