Compact polymers on decorated square lattices
From MaRDI portal
Publication:4949097
Abstract: A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer, on various lattices that are not homogeneous but with a sublattice structure. Estimates for the number are obtained by two methods. One is the saddle point approximation for a field theoretic representation. The other is the numerical diagonalization of the transfer matrix of a fully packed loop model in the zero fugacity limit. In the latter method, several scaling exponents are also obtained.
Recommendations
- Field theory of compact polymers on the square lattice
- Lattice Models of Polymers
- Polymers with nearest- and next nearest-neighbor interactions on the Husimi lattice
- Polymers with attractive interactions on the Husimi lattice
- A model of compact polymers on a family of three-dimensional fractal lattices
- Branched polymers on the twi-dimensional square lattice with attractive surfaces
- The strict-weak lattice polymer
- Lattice polymers with two competing collapse interactions
- Polymer quantization and symmetries
- Adsorption of lattice polymers with quenched topologies
Cited in
(6)- The strict-weak lattice polymer
- Field theory of compact polymers on the square lattice
- Viscoelastic properties of networks
- Hexagonal Patterns in a Simplified Model for Block Copolymers
- Exact partition functions and correlation functions of multiple Hamiltonian walks on the Manhattan lattice.
- Hamiltonian cycles on random lattices of arbitrary genus
This page was built for publication: Compact polymers on decorated square lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4949097)