Institute of Mathematics and Informatics Bulgarian Academy of Sciences
Citation:
Serdica Mathematical Journal, Vol. 38, No 4, (2012), 615p-632p
Abstract:
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.