Leigh Foster, University of Waterloo
Proving the count of boxed plane partitions (box stackings) via the RSK algorithm
The study of lozenge tilings and of the dimer model is a well-established area of research, going back to the 1960's and still subject to active research at present. We will start the learning seminar on this topic with a series of three meetings giving an introduction to the dimer model in its single-dimer version, and considered on a finite hexagonal grid.
This week, we will present a proof of Percy MacMahon's generating functions plane partitions. We will use (a modified version of) the RSK algorithm, also known as the Robinson–Schensted–Knuth correspondence. This gives a count of dimer covers on the hexagonal grid, lozenge tilings of the triangular lattice, and plane partitions, as well as other combinatorial objects.
No prior knowledge of RSK, plane partitions, or much combinatorics is required, and participation is encouraged! Come and learn and ask your questions.
MC 5403