1999
DOI: 10.1070/im1999v063n04abeh000251
|View full text |Cite
|
Sign up to set email alerts
|

The two-dimensional Ising model and the Kac-Ward determinant

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 18 publications
(21 citation statements)
references
References 4 publications
0
21
0
Order By: Relevance
“…1a. and it was an intricate story [98,104,28,60,42] to give a fully rigorous proof of this identity for general planar graphs; see a recent paper [76] by Lis for a streamlined version of the classical approach to (1.5). This formula was generalized to graphs embedded in surfaces in [22].…”
Section: The Kac-ward Matrix and The Terminal Graph Letmentioning
confidence: 99%
“…1a. and it was an intricate story [98,104,28,60,42] to give a fully rigorous proof of this identity for general planar graphs; see a recent paper [76] by Lis for a streamlined version of the classical approach to (1.5). This formula was generalized to graphs embedded in surfaces in [22].…”
Section: The Kac-ward Matrix and The Terminal Graph Letmentioning
confidence: 99%
“…where C(ω) is the number of pairs of edges in ω that cross. The seminal identity of Kac and Ward [22] (which in the general form allowing edge crossings was established in [15,23,31]) reads…”
Section: The Kac-ward Operator and The Fermionic Observablementioning
confidence: 99%
“…Hence together with an idea of Loebl-Masbaum [14], we get an elementary, self-contained proof for the Pfaffian formula. Let us also mention that using the method of Dolbilin et al [5] (and then developed by Cimasoni [3]) one can have a Kac-Ward formula for graphs embedded in (possibly) non-orientable surfaces. In this case generalised Kac-Ward matrices can be encoded using pin − structures, which generalise spin structures to non-orientable surfaces [13].…”
Section: Introductionmentioning
confidence: 99%