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 and . We obtain the value of the connective constant for the lattice in a new shorter way and deduce close bounds for the connective constant for the lattice. Moreover, for both lattice strips we find close lower and upper bounds for the number of SAWs of length 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