Abstract
We prove the Pfaffian Sign Theorem for the dimer model on a triangular lattice embedded in the torus. More specifically, we prove that the Pfaffian of the Kasteleyn periodic-periodic matrix is negative, while the Pfaffians of the Kasteleyn periodic-antiperiodic, antiperiodic-periodic, and antiperiodic-antiperiodic matrices are all positive. The proof is based on the Kasteleyn identities and on small weight expansions. As an application, we obtain an asymptotic behavior of the dimer model partition function with an exponentially small error term.
Similar content being viewed by others
References
Cimasoni, D., Pham, A.M.: Identities between dimer partition functions on different surfaces. J. Stat. Mech. Theory Exp. 2016, 103101 (2016)
Cimasoni, D., Reshetikhin, N.: Dimers on surface graphs and spin structures I. Commun. Math. Phys. 275, 187–208 (2007)
Fendley, P., Moessner, R., Sondhi, S.L.: Classical dimers on the triangular lattice. Phys. Rev. B 66, 214513 (2002)
Galluccio, A., Loebl, M.: On the theory of Pfaffian orientations. I. Perfect matchings and permanents. Electron. J. Combin. 6, R6 (1999)
Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, New York (1993)
Izmailian, NSh, Kenna, R.: Dimer model on a triangular lattice. Phys. Rev. E 84, 021107 (2011)
Kenyon, R.W., Sun, N., Wilson, D.B.: On the asymptotics of dimers on tori. Probab. Theory Relat. Fields 166(3), 971–1023 (2016)
Kasteleyn, P.W.: The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice. Physica 27, 1209–1225 (1961)
Kasteleyn, P.W.: Dimer statistics and phase transitions. J. Math. Phys. 4, 287–293 (1963)
Kasteleyn, P.W.: Graph theory and crystal physics. In: Graph Theory and Theoretical Physics. Academic Press, London (1967)
McCoy, B.M.: Advanced Statistical Mechanics. Oxford University Press, Oxford (2010)
McCoy, B.M., Wu, T.T.: The Two-Dimensional Ising Model, 2nd edn. Dover Publications Inc., New York (2014)
Tesler, G.: Matchings in graphs on non-orientable surfaces. J. Combin. Theory Ser. B 78, 198–231 (2000)
Acknowledgements
The authors thank Barry McCoy and Dan Ramras for useful discussions, and the referee for a simplified proof of Theorem 5.2.
Author information
Authors and Affiliations
Corresponding author
Additional information
Pavel Bleher is supported in part by the National Science Foundation (NSF) Grants DMS-1265172 and DMS-1565602.
Appendices
Appendix A: Proof of Lemma 2.1
We have that
Since each vertex in \(\gamma _i\) is occupied by a dimer either from \(\sigma \) or \(\sigma ',\) and the dimers in \(\sigma \cup \sigma '\) alternate, we conclude that each \(\gamma _i\) is of even length.
By (2.15),
If we enumerate the vertices on \(\Gamma _{m,n}\), i.e. permute the set of vertices \(V_{m,n},\) then by the well-known fact (see e.g. [5]) that for an arbitrary matrix P of order \(mn\times mn,\)
we get
where \(\rho \) is some permutation on \(V_{m,n}.\) Here \(\rho (A)\) denotes a matrix A whose rows and columns have been permuted by \(\rho .\) In other words,
where \([{\mathrm{sgn}\,}(\sigma )]_{\rho }\) indicates the sign of \(\sigma \) with respect to some new enumeration \(\rho \) of vertices. From (A.5), we have that
If we take any two configurations \(\sigma \) and \(\sigma '\), then (A.6) implies that
i.e. the sign of \(\sigma \cup \sigma '\) is invariant under any renumeration of vertices.
Let
where \(v_{j,k}\in \{1,2,\ldots ,mn\}\) denotes the k-th vertex of the j-th contour. Note that \(\rho \) is a renumeration of vertices so that along each \(\gamma _i\) they are rearranged in a cyclical order, starting from one contour and continuing to the next one. Now, the underlying permutations \(\pi (\sigma )\) and \(\pi (\sigma ')\) with respect to \(\rho \) are then:
where
From this equation, Eq. (A.7), and the fact that each \(\gamma _i\) corresponds to a cycle of even length, Lemma 2.1 follows.
Appendix B: Numerical Data for the Pfaffians \(A_i\)
In this Appendix we present numerical data for the Pfaffians \(A_i\) on the \(m\times n\) lattices on the torus for different values m and n. It is interesting to compare these data with the asymptotics of the Pfaffians \(A_i\), obtained in Sects. 6 and 7 above, and also with the identities \({\mathrm{Pf}\,}A_1=-{\mathrm{Pf}\,}A_2\), \({\mathrm{Pf}\,}A_3={\mathrm{Pf}\,}A_4\) for odd n, proven in Sect. 5.
The Pfaffians \(A_i\) for \(m=4\), \(n=3\).
The Pfaffians \(A_i\) for \(m=4\), \(n=4\).
The Pfaffians \(A_i\) for \(m=4\), \(n=6\).
The Pfaffians \(A_i\) for \(m=4\), \(n=8\).
The Pfaffians \(A_i\) for \(m=6\), \(n=6\).
The Pfaffians \(A_i\) for \(m=8\), \(n=8\).
Rights and permissions
About this article
Cite this article
Bleher, P., Elwood, B. & Petrović, D. The Pfaffian Sign Theorem for the Dimer Model on a Triangular Lattice. J Stat Phys 171, 400–426 (2018). https://doi.org/10.1007/s10955-018-2007-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-018-2007-z