Lecture

McKay Graphs of Finite Subgroups of SU(2)

In course
DEMO: veniam eu exercitation sint
Et sint amet cillum tempor et occaecat Lorem duis velit enim. Sunt adipisicing sunt veniam sunt exercitation sunt eiusmod ad ea elit velit esse. Cupidatat id et ad ipsum duis id culpa culpa labore veniam. Tempor est duis est officia ex quis consectetur.
Login to see this section
Description

This lecture covers the concept of McKay graphs for finite subgroups of SU(2), defined as the complete set of inequivalent irreducible representations of the group. The lecture explains the structure of McKay graphs, focusing on their properties and connections between vertices. It delves into the positive semi-definite connected simply laced Coxeter graphs and the McKay correspondence theorem. The lecture also explores exceptional cases and the classification of finite subgroups of SU(2) based on their simply laced irreducible Coxeter types.

Instructor
consequat sint
Est nulla officia velit quis laboris. Cupidatat nostrud exercitation laborum Lorem anim aute. Eiusmod ullamco cupidatat ullamco dolore tempor amet elit culpa est. Qui sunt labore ut excepteur cupidatat ut minim anim.
Login to see this section
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related lectures (41)
Bar Construction: Homology Groups and Classifying Space
Covers the bar construction method, homology groups, classifying space, and the Hopf formula.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Automorphism Groups: Trees and Graphs III
Explores automorphism groups of trees and graphs, including actions on trees and group homomorphisms.
Stochastic Block Model: Community Detection
Covers the Stochastic Block Model for community detection.
Finite Abelian Groups
Covers Cauchy's theorem, classification of finite abelian groups, direct product properties, and more.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.