Combinatorial problems in the two-dimensional Ising model

MaRDI QIDQ3363711zbMATH OpenFDO

Authors Nikolay P. Dolbilin, M. A. Shtan'ko, Mikhail Shtogrin

Publication date 1991

zbMATH Keywords

graphs with recurring connectionone-dimensional cycles modulo 2 in quadratic two-dimensional latticessigns of parametrizationsstatistical sumtwo-dimensional Ising model

Mathematics Subject Classification ID

Singular homology and cohomology theory (55N10) Algebraic topology on manifolds and differential topology (57R19) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Recommendations

• Variations on the Ising problem
• scientific article; zbMATH DE number 4052572
• A combinatorial series expansion for the Ising model
• Revisiting the combinatorics of the 2D Ising model
• The two-dimensional Ising model and the Kac-Ward determinant

Cited in

(10)

• Variations on the Ising problem
• Combinatorial questions of the two-dimensional Ising model
• Combinatorics of a statistical model constructed from the 2 n square lattice
• Revisiting the combinatorics of the 2D Ising model
• Some combinatorial problems in statistical physics
• Combinatorial approach to exactly solve the 1D Ising model
• The signed loop approach to the Ising model: foundations and critical point
• scientific article; zbMATH DE number 4052572 (Why is no real title available?)
• scientific article; zbMATH DE number 27034 (Why is no real title available?)
• Combinatorial Theorem for Graphs on a Lattice

This page was built for publication: Combinatorial problems in the two-dimensional Ising model

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