Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\) (Q1977368)

From MaRDI portal
Revision as of 01:09, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers