A self-avoiding walk (SAW) is a path that does not self-intersect, and the study of its properties leads to important applications in chemistry, biology and computer networks. We consider SAWs on a restricted square lattice with a finite height equal …
Mathematics
The structure of self-avoiding walks and the connective constant
A self-avoiding walk (SAW) is a path that does not self-intersect, and the study of its properties leads to important applications in chemistry, biology and computer networks. We consider SAWs on a restricted square lattice with a finite height equal …