Geodesic
Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
The electronic journal of combinatorics, Tome 7 (2000)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

New upper bounds for the connective constant of self-avoiding walks in a hypercubic lattice are obtained by automatic generation of finite automata for counting walks with finite memory. The upper bound in dimension two is 2.679192495.
DOI : 10.37236/1499
Classification : 82B41, 05A16
Mots-clés : connective constant 
@article{10_37236_1499,
     author = {Andr\'e P\"onitz and Peter Tittmann},
     title = {Improved upper bounds for self-avoiding walks in \(\mathbb {Z^d\)}},
     journal = {The electronic journal of combinatorics},
     year = {2000},
     volume = {7},
     doi = {10.37236/1499},
     zbl = {1034.82023},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1499/}
}
TY  - JOUR
AU  - André Pönitz
AU  - Peter Tittmann
TI  - Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
JO  - The electronic journal of combinatorics
PY  - 2000
VL  - 7
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1499/
DO  - 10.37236/1499
ID  - 10_37236_1499
ER  - 
%0 Journal Article
%A André Pönitz
%A Peter Tittmann
%T Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
%J The electronic journal of combinatorics
%D 2000
%V 7
%U http://geodesic.mathdoc.fr/articles/10.37236/1499/
%R 10.37236/1499
%F 10_37236_1499
André Pönitz; Peter Tittmann. Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\). The electronic journal of combinatorics, Tome 7 (2000). doi: 10.37236/1499

Cité par Sources :