相关论文: Matching measure, Benjamini-Schramm convergence an…

We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…

Using exact computations we study the classical hard-core monomer-dimer models on m x n plane lattice strips with free boundaries. For an arbitrary number v of monomers (or vacancies), we found a logarithmic correction term in the…

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

The classical monomer-dimer model in two-dimensional lattices has been shown to belong to the \emph{``#P-complete''} class, which indicates the problem is computationally ``intractable''. We use exact computational method to investigate the…

The matching energy is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph, which is proposed first by Gutman and Wagner [The matching energy of a graph, Discrete Appl. Math. 160 (2012) 2177--2187].…

We give a characterization of equilibrium measures for $p$-capacities on the boundary of an infinite tree of arbitrary (finite) local degree. For $p=2$, this provides, in the special case of trees, a converse to a theorem of Benjamini and…

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…

This work addresses the question of whether it is possible to define simple pair-wise interaction terms to approximate free energies of proteins or polymers. Rather than ask how reliable a potential of mean force is, one can ask how…

We solve the monomer-dimer problem on a non-bipartite lattice, the simple quartic lattice with cylindrical boundary conditions, with a single monomer residing on the boundary. Due to the non-bipartite nature of the lattice, the well-known…

This work establishes links between the Ising model and elliptic curves via Mahler measures. First, we reformulate the partition function of the Ising model on the square, triangular and honeycomb lattices in terms of the Mahler measure of…

In this work we study the interleaving distance between merge trees from a combinatorial point of view. We use a particular type of matching between trees to obtain a novel formulation of the distance. With such formulation, we tackle the…

We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…

We introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid Dim L is commutative and conical, the latter meaning that the sum of any two nonzero elements is nonzero. Furthermore, Dim L is given along with the dimension…

Using lattice simulations of a one-component $(\lambda \Phi^4)_4$ theory, we have measured the energy spectrum $\omega({\mathbf{k}})$ in the broken phase at various lattice sizes. Our data show that the energy-gap $\omega(0)$ is {\it not}…

We study the thermodynamic properties of a semiflexible polymer confined inside strips of widths L<=9 defined on a square lattice. The polymer is modeled as a self-avoiding walk and a short range interaction between the monomers and the…

The correlation functions of an arbitrary number of boundary monomers in the system of close-packed dimers on the square lattice are computed exactly in the scaling limit. The equivalence of the 2n-point correlation functions with those of…

The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…

We consider the monomer-dimer model on sequences of random graphs locally convergent to trees. We prove that the monomer density converges almost surely, in the thermodynamic limit, to an analytic function of the monomer activity. We…

We present a lattice model for polymer solutions, explicitly incorporating interactions with a bath of solvent and cosolvent molecules. By exploiting the well-known analogy between polymer systems and the $O(n)$-vector spin model in the…

The complexity of a finite connected graph is its number of spanning trees; for a non-connected graph it is the product of complexities of its connected components. If $G$ is an infinite graph with cofinite free ${\mathbb Z}^d$-symmetry,…