Talk
Speaker: Terrence George, MIT
Host: Niranjan Balachandran
Title: Limit shapes beyond classical tilings
Time, day and date: 9:30:00 AM – 10:30:00 AM, Friday, March 20
Venue: Online (meet.google.com/dyx-hzmn-cbj)
Abstract: The dimer model refers to the study of random dimer covers, or perfect matchings, of a bipartite graph. A remarkable feature of these models is the emergence of limit shapes: in large periodic graphs, a random matching typically concentrates around a deterministic shape. Although limit shapes arise quite generally in dimer models, they are explicitly understood only in two classical cases, namely the hexagonal and square lattices, corresponding to lozenge and domino tilings. In this talk, I will explain how ideas from integrable systems make it possible to compute limit shapes for arbitrary periodic dimer models. This is based on joint work in progress with Tomas Berggren and Alexei Borodin.