English

Self-avoiding Walks of Lattice Strips

Combinatorics 2017-09-28 v1

Abstract

We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips Z×{1,0,1}\mathbb{Z} \times \{-1,0,1\} and Z×{1,0,1,2}\mathbb{Z}\times \{-1,0,1,2\}. We obtain the value of the connective constant for the Z×{1,0,1}\mathbb{Z} \times \{-1,0,1\} lattice in a new shorter way and deduce close bounds for the connective constant for the Z×{1,0,1,2}\mathbb{Z}\times \{-1,0,1,2\} lattice. Moreover, for both lattice strips we find close lower and upper bounds for the number of SAWs of length nn by using the connective constant.

Keywords

Cite

@article{arxiv.1709.09223,
  title  = {Self-avoiding Walks of Lattice Strips},
  author = {Rumen Dangovski and Chavdar Lalov},
  journal= {arXiv preprint arXiv:1709.09223},
  year   = {2017}
}

Comments

16 pages, 10 figures

R2 v1 2026-06-22T21:55:50.524Z