Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) (Q1977368): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:40, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) |
scientific article |
Statements
Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) (English)
0 references
11 May 2000
0 references
Summary: 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.
0 references
connective constant
0 references
