A short proof of the Kac-Ward formula

DOI10.4171/AIHPD/24MaRDI QIDQ254753zbMATH OpenOpenAlexFDO

Authors Marcin Lis

Publication date 16 March 2016

Published in Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.04322

zbMATH Keywords

Ising modelKac-Ward formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We present a short proof of the Kac-Ward formula for the partition function of the Ising model on planar graphs.

Cites work

• Ising model observables and non-backtracking walks
• Random walk: A modern introduction
• Remarks on the Combinatorial Approach to the Ising Problem
• The signed loop approach to the Ising model: foundations and critical point

Cited in

(6)

• Lectures on the Ising and Potts models on the hypercubic lattice
• Kac-Ward formula and its extension to order-disorder correlators through a graph zeta function
• The Feynman identity for planar graphs
• The planar Ising model and total positivity
• Non-backtracking loop soups and statistical mechanics on spin networks
• A simple proof and short forms for the Kuhn-Fourier theorem

This page was built for publication: A short proof of the Kac-Ward formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q254753)