Computing a pyramid partition generating function with dimer shuffling

Details Computing a pyramid partition generating function with dimer shuffling Computing a pyramid partition generating function with dimer shuffling

2007-09-19

arxiv.org/abs/0709.3079v2

Mathematics

Combinatorics

19 pages, 13 figures. v2: fixed minor typos, updated references and future work; added some definitions to Section 6

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing a pyramid partition generating function with dimer shuffling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing a pyramid partition generating function with dimer shuffling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing a pyramid partition generating function with dimer shuffling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337374