From dilute to dense self-avoiding walks on hypercubic lattices

A field-theoretic representation is presented to count the number of configurations of a single self-avoiding walk on a hypercubic lattice ind dimensions with periodic boundary conditions. We evaluate the connectivity constant as a function of the fractionf of sites occupied by the polymer chain. The meanfield approximation is exact in the limit of infinite dimensions, and corrections to it in powers ofd ^–1 can be systematically evaluated. The connectivity constant and the site entropy calculated throughout second order compare well with known results in two and three dimensions. We also find that the entropy per site develops a maximum atf1–(2d)^–1. Ford=2 (d=3), this maximum occurs atf~0.80 (f~0.86) and its value is about 50% (30%) higher than the entropy per site of a Hamiltonian walk (f=1).