Related papers: Exactly Solvable Lattice Models with Crossing Symm…
A powerful existing technique for evaluating statistical mechanical quantities in two-dimensional Ising models is based on constructing a matrix representing the nearest neighbor spin couplings and then evaluating the Pfaffian of the…
Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer…
The critical Boltzmann weights for lattice analogues of the $N=2$ superconformal coset models $\frac{G_1 \times SO(dim(G/H))}{H}$ were given in \cite{nick}. In this paper Bethe Ansatz methods are employed to calculate the spectrum of the…
In this paper, we construct solvable ice models (six-vertex models) with stochastic weights and U-turn right boundary, which we term ``stochastic symplectic ice''. The models consist of alternating rows of two types of vertices. The…
The q-state Potts model is a fundamental framework in statistical physics and graph theory, with its partition function encoding rich information about spin configurations. The multivariate Tutte polynomial (known as the partition function…
We study the hard-core model defined on independent sets, where each independent set I in a graph G is weighted proportionally to $\lambda^{|I|}$, for a positive real parameter $\lambda$. For large $\lambda$, computing the partition…
In this work, exact solutions are obtained for a class of generalized gauge-invariant $n$-chain Ising models ($n=1,2,3,4$) with arbitrary multi-spin interactions that are invariant under the local $\mathbb{Z}_2$ gauge group. On a strip…
The present study proposes a highly accurate lattice Boltzmann direct coupling cell-vertex algorithm, well suited for industrial purposes, making it highly valuable for aeroacoustic applications. It is indeed known that the convection of…
Using methods from Analytic Combinatorics, we study the families of perfect matchings, partitions, chord diagrams, and hyperchord diagrams on a disk with a prescribed number of crossings. For each family, we express the generating function…
The partition lattice and noncrossing partition lattice are well studied objects in combinatorics. Given a graph $G$ on vertex set $\{1,2,\dots, n\}$, its bond lattice, $L_G$, is the subposet of the partition lattice formed by restricting…
We present three classes of exactly solvable models for fermion and boson systems, based on the pairing interaction. These models are solvable in any dimension. As an example we show the first results for fermion interacting with repulsive…
The density of states for the three-dimensional Ising model is calculated with high-precision from multicanonical simulations. This allows us to estimate the leading partition function zeros for lattice sizes up to L=32. Combining previous…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
The balanced connected $k$-partition problem (\textsc{bcp}) is a classic problem, which consists in partitioning the set of vertices of a vertex-weighted connected graph into a collection of~$k$ classes such that each class induces a…
This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…
We develop a new method to compute the exact overlaps between integrable boundary states and on-shell Bethe states for integrable spin chains. Our method is based on the coordinate Bethe Ansatz and does not rely on the "rotation trick" of…
We introduce lattice models with explicit N=2 supersymmetry. In these interacting models, the supersymmetry generators Q^+ and Q^- yield the Hamiltonian H={Q^+,Q^-} on any graph. The degrees of freedom can be described as either fermions…
The lattice spin model with $Q$--component discrete spin variables restricted to have orientations orthogonal to the faces of $Q$-dimensional hypercube is considered on the Bethe lattice, the recursive graph which contains no cycles. The…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
We describe how the usual supercharges of extended supersymmetry may be {\it twisted} to produce a BRST-like supercharge $Q$. The usual supersymmetry algebra is then replaced by a twisted algebra and the action of the twisted theory is…