@article{Dangovski2012,
abstract = {2010 Mathematics Subject Classification: Primary: 05C81. Secondary: 60G50.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.},
author = {Dangovski, Rumen},
journal = {Serdica Mathematical Journal},
keywords = {Self-Avoiding Walks},
language = {eng},
number = {4},
pages = {615-632},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {On self-avoiding walks on certain grids and the connective constant},
url = {http://eudml.org/doc/288253},
volume = {38},
year = {2012},
}
TY - JOUR
AU - Dangovski, Rumen
TI - On self-avoiding walks on certain grids and the connective constant
JO - Serdica Mathematical Journal
PY - 2012
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 38
IS - 4
SP - 615
EP - 632
AB - 2010 Mathematics Subject Classification: Primary: 05C81. Secondary: 60G50.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.
LA - eng
KW - Self-Avoiding Walks
UR - http://eudml.org/doc/288253
ER -
