On self-avoiding walks on certain grids and the connective constant
Serdica Mathematical Journal, Tome 38 (2012) no. 4, pp. 615-632
Voir la notice de l'article provenant de la source Bulgarian Digital Mathematics Library
We consider self-avoiding walks on the square grid graph. More precisely we investigate the number of walks of a fixed length on Z×{-1,0,1}. Using combinatorial arguments we derive the related generating function. We present the asymptotic estimates of the number of walks in consideration, as well as important connective constants.
Keywords:
Self-Avoiding Walks
@article{SMJ2_2012_38_4_a3,
author = {Dangovski, Rumen},
title = {On self-avoiding walks on certain grids and the connective constant},
journal = {Serdica Mathematical Journal},
pages = {615--632},
publisher = {mathdoc},
volume = {38},
number = {4},
year = {2012},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SMJ2_2012_38_4_a3/}
}
Dangovski, Rumen. On self-avoiding walks on certain grids and the connective constant. Serdica Mathematical Journal, Tome 38 (2012) no. 4, pp. 615-632. http://geodesic.mathdoc.fr/item/SMJ2_2012_38_4_a3/