相关论文: Regular structures of an intractable enumeration p…
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…
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…
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…
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…
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-…
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.
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…
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…
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…
By means of contact-density chain-growth simulations, we investigate a simple lattice model of a flexible polymer interacting with an attractive substrate. The contact density is a function of the numbers of monomer-substrate and…
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…
We study the localisation of lattice polymer models near a permeable interface in two dimensions. Localisation can arise due to an interaction between the polymer and the interface, and can be altered by a preference for the bulk solvent on…
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…
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…
We construct a class of lattices in three and higher dimensions for which the number of dimer coverings can be determined exactly using elementary arguments. These lattices are a generalization of the two-dimensional kagome lattice, and the…
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…
We study the collapse of two-dimensional polymers, via an O($n$) model on the square lattice that allows for dilution, bending rigidity and short-range monomer attractions. This model contains two candidates for the theta point,…
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…
The conformations of interacting linear polymers on a dynamical planar random lattice are studied using a random two-matrix model. An exact expression for the partition function of self-avoiding chains subject to attractive contact…