On the Higher-Rank Dimer Model
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
Google AI Professional Certificate - Learn AI Skills That Get You Hired
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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)