相关论文: Approximating the monomer-dimer constants through …

Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data values per region (over time or different datasets) shown as…

The classical 1961 solution to the problem of determining the number of perfect matchings (or dimer coverings) of a rectangular grid graph -- due independently to Kasteleyn and to Temperley and Fisher -- consists of changing the sign of…

We formulate a natural model of current loops and magnetic monopoles for arbitrary planar graphs, which we call the monopole-dimer model, and express the partition function of this model as a determinant. We then extend the method of…

Every square matrix $A=(a_{uv})\in \mathcal{C}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant…

It is well-known that the evaluation of the permanent of an arbitrary $(-1,1)$-matrix is a formidable problem. Ryser's formula is one of the fastest known general algorithms for computing permanents. In this paper, Ryser's formula has been…

We study the entropy of a set of identical hard objects, of general shape, with each object pivoted on the vertices of a d-dimensional regular lattice of lattice spacing a, but can have arbitrary orientations. When the pivoting point is…

A recent simplified transfer matrix solution of the two-dimensional Ising model on a square lattice with periodic boundary conditions is generalized to periodic-antiperiodic, antiperiodic-periodic and antiperiodic-antiperiodic boundary…

We study the complexity of approximating the permanent of a positive semidefinite matrix $A\in \mathbb{C}^{n\times n}$. 1. We design a new approximation algorithm for $\mathrm{per}(A)$ with approximation ratio $e^{(0.9999 + \gamma)n}$,…

It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…

We introduce an algorithm based on Generalized Dual Method (GDM) to efficiently study the dynamics of a particle in quasiperiodic environments without the need to use periodic approximations or to save the information of the vertices that…

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

\noindent By a seminal result of Valiant, computing the permanent of $(0,1)$-matrices is, in general, $\#\mathsf{P}$-hard. In 1913 P\'olya asked for which $(0,1)$-matrices $A$ it is possible to change some signs such that the permanent of…

The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Minc's conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some…

This paper makes three contributions to estimating the number of perfect matching in bipartite graphs. First, we prove that the popular sequential importance sampling algorithm works in polynomial time for dense bipartite graphs. More…

The problem of counting monomer-dimer coverings of a lattice is a longstanding problem in statistical mechanics. It has only been exactly solved for the special case of dimer coverings in two dimensions. In earlier work, Stanley proved a…

We study Heisenberg antiferromagnets on a diamond-like decorated square lattice perturbed by further neighbor couplings. The second-order effective Hamiltonian is calculated and the resultant Hamiltonian is found to be a square-lattice…

We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D…

The thermodynamics and dynamics of a one dimensional dimer-forming anharmonic model is studied in the classical limit. This model mimics the behavior of materials with a Peierls instability. Specific heat, correlation length, and order…

We study various statistical properties of the double-dimer model, a generalization of the dimer model, on rectangular domains of the square lattice. We take advantage of the Grassmannian representation of the dimer model, first to…

We define the matching measure of a lattice L as the spectral measure of the tree of self-avoiding walks in L. We connect this invariant to the monomer-dimer partition function of a sequence of finite graphs converging to L. This allows us…