Geodesic
Enumerating up-side self-avoiding walks on integer lattices
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. Though mathematicians have studied saws for over fifty years, the number of $n$-step saws is unknown. This paper examines a special case of this problem, finding the number of $n$-step "up-side" saws (ussaws), saws restricted to moving up and sideways. It presents formulas for the number of $n$-step ussaws on various lattices, found using generating functions with decomposition and recursive methods.
DOI : 10.37236/1255
Classification : 05A15
Mots-clés : self-avoiding walk, lattice, generating functions 
@article{10_37236_1255,
     author = {Lauren K. Williams},
     title = {Enumerating up-side self-avoiding walks on integer lattices},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1255},
     zbl = {0885.05005},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1255/}
}
TY  - JOUR
AU  - Lauren K. Williams
TI  - Enumerating up-side self-avoiding walks on integer lattices
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1255/
DO  - 10.37236/1255
ID  - 10_37236_1255
ER  - 
%0 Journal Article
%A Lauren K. Williams
%T Enumerating up-side self-avoiding walks on integer lattices
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1255/
%R 10.37236/1255
%F 10_37236_1255
Lauren K. Williams. Enumerating up-side self-avoiding walks on integer lattices. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1255

Cité par Sources :