A Pfaffian Formula for Monomer–Dimer Partition Functions
- 212 Downloads
We consider the monomer–dimer partition function on arbitrary finite planar graphs and arbitrary monomer and dimer weights, with the restriction that the only non-zero monomer weights are those on the boundary. We prove a Pfaffian formula for the corresponding partition function. As a consequence of this result, multipoint boundary monomer correlation functions at close packing are shown to satisfy fermionic statistics. Our proof is based on the celebrated Kasteleyn theorem, combined with a theorem on Pfaffians proved by one of the authors, and a careful labeling and directing procedure of the vertices and edges of the graph.
KeywordsMonomer–dimer problem Pfaffian formula Boundary monomers
Thanks go to Jan Philip Solovej and Lukas Schimmer for devoting their time to some preliminary calculations that helped put us on the right track. We also would like to thank Tom Spencer and Joel Lebowitz for their hospitality at the IAS in Princeton and their continued interest in this problem. In addition, we thank Michael Aizenman and Hugo Duminil-Copin for discussing their work in progress on the random current representation for planar lattice models with us. We thank Jacques Perk and Fa Yueh Wu for very useful historical comments. We gratefully acknowledge financial support from the A*MIDEX project ANR-11-IDEX-0001-02 (A.G.), from the PRIN National Grant Geometric and analytic theory of Hamiltonian systems in finite and infinite dimensions (A.G. and I.J.), and NSF grant PHY-1265118 (E.H.L.).
- 7.Dubédat, J.: Exact bosonization of the Ising model, arXiv:1112.4399, (2011)
- 10.Fisher, M., Hartwig, R.E.: In: Shuler, K.E. (ed.) Stochastic Processes in Chemical Physics, vol. 15, p. 333. Wiley, New York (1969)Google Scholar
- 13.Giuliani, A., Mastropietro, V., Toninelli, F.L.: Height fluctuations in interacting dimers, Annales de l’Institut Henri Poincaré, Probability and Statistics, in press, arXiv:1406.7710, (2015)
- 29.Pinson, H., Spencer, T.: Universality and the two-dimensional Ising model, unpublishedGoogle Scholar
- 35.Temperley, H.N.V.: Enumeration of graphs on a large periodic lattice, combinatorics. In: The Proceedings of the British Combinatorical Conference, 1973, London Mathematical Society lecture note series, Vol. 13, Cambridge University Press, 1974Google Scholar