Domino shuffling for the Del Pezzo 3 lattice

Details Domino shuffling for the Del Pezzo 3 lattice Domino shuffling for the Del Pezzo 3 lattice

2010-10-30

arxiv.org/abs/1011.0045v3

Mathematics

Combinatorics

19 pages, 17 figures. V2: Changes to introduction and conclusion; references updated. V3: Correction to the statement of Theor

Scientific paper

We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on a family of finite subgraphs of this lattice whose boundary conditions are compatible with our algorithm. In particular, we re-prove an enumerative theorem of Ciucu, as well as finding a related family of subgraphs which have 2^{(n+1)^2} perfect matchings. We also give three-variable generating functions for perfect matchings on both families of graphs, which encode certain statistics on the height functions of these graphs.

Affiliated with

Also associated with

No associations

Rating

Domino shuffling for the Del Pezzo 3 lattice 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 Domino shuffling for the Del Pezzo 3 lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domino shuffling for the Del Pezzo 3 lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-405148