Related papers: Approximating the monomer-dimer constants through …
Using the monomer--dimer representation of the lattice Schwinger model, with $N_f =1$ Wilson fermions in the strong--coupling regime ($\beta=0$), we evaluate its partition function, $Z$, exactly on finite lattices. By studying the zeroes of…
We study the collapse transition of the lattice homopolymer on a square lattice by calculating the exact partition function zeros. The exact partition function is obtained by enumerating the number of possible conformations for each energy…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…
We write exact equations for the thermodynamic properties of a linear polymer molecule confined to walk on a lattice of finite size. The dimension of the space in which the lattice resides can be arbitrary. We also calculate polymer…
There is no an exact solution to three-dimensional (3D) finite-size Ising model (referred to as the Ising model hereafter for simplicity) and even two-dimensional (2D) Ising model with non-zero external field to our knowledge. Here by using…
We present analytic results for a special dimer model on the {\em non-bipartite} and {\em non-planar} checkerboard lattice that does not allow for parallel dimers surrounding diagonal links. We {\em exactly} calculate the number of closed…
In this paper we review the asymptotic matching conjectures for $r$-regular bipartite graphs, and their connections in estimating the monomer-dimer entropies in $d$-dimensional integer lattice and Bethe lattices. We prove new rigorous upper…
We express the finite 3D Dimer partition function as a linear combination of determinants of oriented adjacency matrices, and the finite 3D Ising partition sum as a linear combination of products over aperiodic closed walks. The methodology…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
In the monomer-polymer model, a linear rigid polymer covers $k$ adjacent lattice sites, with no lattice site occupied by more than one polymer. The polymers are called $k$-mers, and those unoccupied lattice sites are called monomers. The…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
Computing the permanent of a non-negative matrix is a core problem with practical applications ranging from target tracking to statistical thermodynamics. However, this problem is also #P-complete, which leaves little hope for finding an…
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…
The finite volume correction for a mean-field monomer-dimer system with an attractive interaction are computed for the pressure density, the monomer density and the susceptibility. The results are obtained by introducing a two-dimensional…
The monopole-dimer model is a signed variant of the monomer-dimer model which has determinantal structure. We extend the monopole-dimer model for planar graphs (Math. Phys. Anal. Geom., 2015) to Cartesian products thereof and show that the…
We show that spectral problems for periodic operators on lattices with embedded defects of lower dimensions can be solved with the help of matrix-valued integral continued fractions. While these continued fractions are usual in the…
The combinatorial mutation of polygons, which transforms a given lattice polygon into another one, is an important operation to understand mirror partners for two-dimensional Fano manifolds, and the mutation-equivalent polygons give…