Computing a pyramid partition generating function with dimer shuffling
| dc.creator | Young, Benjamin | |
| dc.date | 2007-09-19 | |
| dc.date | 2008-07-02 | |
| dc.date.accessioned | 2026-07-07T09:47:46Z | |
| dc.date.available | 2026-07-07T09:47:46Z | |
| dc.description | We verify a recent conjecture of Kenyon/Szendroi, arXiv:0705.3419, by computing the generating function for pyramid partitions. Pyramid partitions are closely related to Aztec Diamonds; their generating function turns out to be the partition function for the Donaldson--Thomas theory of a non-commutative resolution of the conifold singularity {x1x2 -x3x4 = 0}. The proof does not require algebraic geometry; it uses a modified version of the domino shuffling algorithm of Elkies, Kuperberg, Larsen and Propp. | |
| dc.description | 19 pages, 13 figures. v2: fixed minor typos, updated references and future work; added some definitions to Section 6 | |
| dc.identifier | https://arxiv.org/abs/0709.3079 | |
| dc.identifier | http://arxiv.org/abs/0709.3079 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163968 | |
| dc.subject | Combinatorics | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 05A15 | |
| dc.title | Computing a pyramid partition generating function with dimer shuffling | |
| dc.type | text |