Related papers: Polynomial algorithm for exact calculation of part…
The partition function of the two-dimensional Ising model with zero magnetic field on a square lattice with m x n sites wrapped on a torus is computed within the transfer matrix formalism in an explicit step-by-step approach inspired by…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
In 1944 Onsager published the formula for the partition function of the Ising model for the infinite square lattice. He was able to express the internal energy in terms of a special function, but he left the free energy as a definite…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
In this paper, we show that calculating the partition function of optimal medians of binary strings with Hamming distance is \#P-complete for several weight functions. The case when the weight function is the factorial function has…
We perform the calculation of the partition function of the Poisson-sigma model on the world sheet with the topology of a two-dimensional disc. Considering the special case of a linear Poisson structure we recover the partition function of…
Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the…
We provide a concise exposition with original proofs of combinatorial formulas for the 2D Ising model partition function, multi-point fermionic observables, spin and energy density correlations, for general graphs and interaction constants,…
This paper presents a quantum algorithm for efficiently computing partial sums and specific weighted partial sums of quantum state amplitudes. Computation of partial sums has important applications, including numerical integration,…
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 evaluate the performance of different algorithms in minimizing the Hamiltonian of a spatial-photonic Ising machine (SPIM). We then encode the number-partitioning problem on the SPIM and adiabatically arrive at good solutions for the…
We give algorithms for approximating the partition function of the ferromagnetic $q$-color Potts model on graphs of maximum degree $d$. Our primary contribution is a fully polynomial-time approximation scheme for $d$-regular graphs with an…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
We consider the Minimum Steiner Cut problem on undirected planar graphs with non-negative edge weights. This problem involves finding the minimum cut of the graph that separates a specified subset $X$ of vertices (terminals) into two parts.…
We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…
We characterize the entire functions $P$ of $d$ variables, $d\ge 2,$ for which the $\mzd$-translates of $P\chi_{[0,N]^d}$ satisfy the partition of unity for some $N\in \mn.$ In contrast to the one-dimensional case, these entire functions…
We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.
We propose the Kazakov-Migdal model on graphs and show that, when the parameters of this model are appropriately tuned, the partition function is represented by the unitary matrix integral of an extended Ihara zeta function, which has a…
In a recent paper, the partition function (character) of ten-dimensional pure spinor worldsheet variables was calculated explicitly up to the fifth mass-level. In this letter, we propose a novel application of Pade approximants as a tool…
Here we prove that counting maximum matchings in planar, bipartite graphs is #P-complete. This is somewhat surprising in the light that the number of perfect matchings in planar graphs can be computed in polynomial time. We also prove that…