Hostname: page-component-6766d58669-h8lrw Total loading time: 0 Render date: 2026-05-24T02:52:34.779Z Has data issue: false hasContentIssue false

Upper Bounds for the Connective Constant of Self-Avoiding Walks

Published online by Cambridge University Press:  12 September 2008

Sven Erick Alm
Affiliation:
Department of Mathematics, Uppsala University, PO Box 480, S-751 06 Uppsala, Sweden

Abstract

We present a method for obtaining upper bounds for the connective constant of self-avoiding walks. The method works for a large class of lattices, including all that have been studied in connection with self-avoiding walks. The bound is obtained as the largest eigenvalue of a certain matrix. Numerical application of the method has given improved bounds for all lattices studied, e.g. μ < 2.696 for the square lattice, μ < 4.278 for the triangular lattice and μ < 4.756 for the simple cubic lattice.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable