Related papers: Recurrence solution of monomer-polymer models on t…
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…
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…
The exact enumeration of pure dimer coverings on the square lattice was obtained by Kasteleyn, Temperley and Fisher in 1961. In this paper, we consider the monomer-dimer covering problem (allowing multiple monomers) which is an outstanding…
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…
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…
We use computational method to investigate the number of ways to pack dimers on \emph{odd-by-odd} lattices. In this case, there is always a single vacancy in the lattices. We show that the dimer configuration numbers on $(2k+1) \times…
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.
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts that increase coverage are accepted. The process continues indefinitely on an infinite substrate, and we analyze the…
A lattice model is presented for the simulation of dynamics in polymeric systems. Each polymer is represented as a chain of monomers, residing on a sequence of nearest-neighbor sites of a face-centered-cubic lattice. The polymers are self-…
We consider close-packed dimers, or perfect matchings, on two-dimensional regular lattices. We review known results and derive new expressions for the free energy, entropy, and the molecular freedom of dimers for a number of lattices…
The central idea of this article is to present a systematic approach to construct some recurrence relations for the solutions of the second-order linear difference equation of hypergeometric-type defined on the quadratic-type lattices. We…
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…
We use a recently developed lattice model to study the percolation of particles of different sizes and shapes in the presence of a polymer matrix. The polymer is modeled as an infinitely long semiflexible chain. We study the effects of the…
We reassess the relation between classical lattice dimer models and the continuum elastic description of a lattice of fluctuating polymers. In the absence of randomness we determine the density and line tension of the polymers in terms of…
The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…
The monomer-dimer model is fundamental in statistical mechanics. However, it is $#P$-complete in computation, even for two dimensional problems. A formulation in matrix permanent for the partition function of the monomer-dimer model is…
Directed polymers on 1+1 dimensional lattices coupled to a heat bath at temperature $T$ are studied numerically for three ensembles of the site disorder. In particular correlations of the disorder as well as fractal patterning are…
In a recent paper S. Friedland and the author presented a formal expression for lambda_d(p) of the monomer-dimer problem on a d-dimensional rectangular lattice, which involved a power series in p. Herein, we find simlar expressions for…
The dimer problem arose in a thermodynamic study of diatomic molecules, and was abstracted into one of the most basic and natural problems in both statistical mechanics and combinatoric mathematics. Given a rectangular lattice of volume V…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…