A generalized Kac-Ward formula

Abstract

The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straight edges from the determinant of a matrix of size 2N, where N denotes the number of edges of G. In this paper, we extend this formula to any finite graph: the partition function can be written as an alternating sum of the determinants of 2^{2g} matrices of size 2N, where g is the genus of an orientable surface in which G embeds. We give two proofs of this generalized formula. The first one is purely combinatorial, while the second relies on the Fisher-Kasteleyn reduction of the Ising model to the dimer model, and on geometric techniques. As a consequence of this second proof, we also obtain the following fact: the Kac-Ward and the Fisher-Kasteleyn methods to solve the Ising model are one and the same.

23 pages, 8 figures; minor corrections in v2; to appear in J. Stat. Mech. Theory Exp

Cited by in corpus (16)

• Revisiting the combinatorics of the 2D Ising model
• Conformal invariance of lattice models
• Duality between Spin networks and the 2D Ising model
• The critical Ising model via Kac-Ward matrices
• Phase transition free regions in the Ising model via the Kac-Ward operator
• What does it take to solve the 3D Ising model? Minimal necessary conditions for a valid solution
• The fermionic observable in the Ising model and the inverse Kac-Ward operator
• Ising Model Observables and Non-Backtracking Walks
• Derivation of the free energy, entropy and specific heat for planar Ising models: Application to Archimedean lattices and their duals
• Kac-Ward formula and its extension to order-disorder correlators through a graph zeta function
• A Pfaffian formula for the Ising partition function of surface graphs
• Critical Temperature of Periodic Ising Models
• Feynman identity for planar graphs
• The critical temperature for the Ising model on planar doubly periodic graphs
• Kac-Ward solution of the 2D classical and 1D quantum Ising models
• An analogue to the Witt identity