On the Higher-Rank Dimer Model
Offered By: Institute for Pure & Applied Mathematics (IPAM) via YouTube
Course Description
Overview
Explore a 51-minute conference talk by Richard Kenyon of Yale University on the higher-rank dimer model, presented at IPAM's Vertex Models workshop. Delve into the definition of a Kasteleyn operator on a planar bipartite graph with a GL(n) local system and discover how its determinant counts traces of "n-multiwebs," generalizing dimer configurations. Examine the computation of connection probabilities in the scaling limit for SL(3) and their conformal invariance. Gain insights from this joint work with Dan Douglas and Haolin Shi, expanding your understanding of algebraic and probabilistic aspects of universality in vertex models.
Syllabus
Richard Kenyon - On the higher-rank dimer model - IPAM at UCLA
Taught by
Institute for Pure & Applied Mathematics (IPAM)
Related Courses
Analytic Combinatorics, Part IPrinceton University via Coursera Analytic Combinatorics, Part II
Princeton University via Coursera Analytic Combinatorics
Princeton University via Coursera Principles of Computing (Part 1)
Rice University via Coursera Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera