Ben Young

Computing a partition function with dimer shuffling

I will explain how to compute the generating function for a class of combinatorial objects called pyramid partitions. This generating function also turns out to be the partition function for the Donaldson--Thomas theory of a non-commutative resolution of the conifold singularity {x1x2 -x3x4 = 0}, according to recent work by Szendroi. The proof uses a modified version of the domino shuffling algorithm of Elkies, Kuperberg, Larsen and Propp.