Related papers: The critical Ising model via Kac-Ward matrices
We introduce the notion of dual perfect bases and dual perfect graphs. We show that every integrable highest weight module $V_q(\lambda)$ over a quantum generalized Kac-Moody algebra $U_{q}(\mathcal{g})$ has a dual perfect basis and its…
The partition function for two-dimensional nearest neighbour Ising models in the presence of a magnetic field is derived . A comparison with the partition functions predicted by Onsager is carried out. The critical temperature estimated by…
The critical group of a connected graph is closely related to the graph Laplacian, and is of high research value in combinatorics, algebraic geometry, statistical physics, and several other areas of mathematics. In this paper, we study the…
We consider integrable systems that are connected with orthogonal separation of variables in complex Riemannian spaces of constant curvature. An isomorphism with the hyperbolic Gaudin magnet, previously pointed out by one of us, extends to…
The partition function of the two-dimensional Ising model is exactly obtained on a lattice with a twisted boundary condition. The continuum limit of the model off the critical temperature is found to give the mass-deformed Ising conformal…
It is conjectured by Chen and Raspaud that for each integer $k \ge 2$, any graph $G$ with \[ \mathrm{mad}(G) < \frac{2k+1}{k} \quad\text{and}\quad \mathrm{odd\text{-}girth}(G) \ge 2k+1 \] admits a homomorphism into the Kneser graph…
The current paper is dedicated to the problem of finding the number of mutually non isomorphic bipartite graphs of the type $g=\langle R_g ,C_g ,E_g \rangle$ at given $n=|R_g |$ and $m=|C_g |$, where $R_g$ and $C_g$ are the two disjoint…
For any graphs $G$ and $H$, we say that a bound is of Vizing-type if $\gamma(G\square H)\geq c \gamma(G)\gamma(H)$ for some constant $c$. We show several bounds of Vizing-type for graphs $G$ with forbidden induced subgraphs. In particular,…
We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances from the elements of the generators. Specifically we introduce…
We study the Ising model with an external magnetic field on random tetravalent planar maps and investigate its critical behavior. Explicit expressions for spontaneous magnetization and the susceptibility are computed and the critical…
The partition function of the 2D Ising model coupled to an external magnetic field is studied. We show that the sum over the spin variables can be reduced to an integration over a finite number of variables. This integration must be…
We consider a random surface representation of the three-dimensional Ising model.The model exhibit scaling behaviour and a new critical index $\k$ which relates $\g_{string}$ for the bosonic string to the exponent $\a$ of the specific heat…
We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter $\lambda$ on the unit circle in the complex plane. Complex-valued parameters for the Ising…
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions…
We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with…
We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and…
The Binder cumulant at the phase transition of Ising models on square lattices with various ferromagnetic nearest and next-nearest neighbour couplings is determined using mainly Monte Carlo techniques. We discuss the possibility to relate…
We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalently, the Ising partition function, of a graph.
We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in terms of the relation between the edge interaction $\beta$ and a parameter $\Delta$ which is an upper bound on the maximum…
A geometric formula for the zeros of the partition function of the inhomogeneous 2d Ising model was recently proposed in terms of the angles of 2d triangulations embedded in the flat 3d space. Here we proceed to an analytical check of this…