Upper Bounds for the Connective Constant of Self-Avoiding Walks

DOI10.1017/S0963548300000547zbMATH Open0793.60082OpenAlexW2005105063MaRDI QIDQ4290083FDOQ4290083

Authors: Sven Erick Alm 

Publication date: 11 August 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300000547

Recommendations

• New upper bounds for the connective constants of self-avoiding walks
• Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
• Upper bounds for the connective constant in \(\mathbb Z^d\)
• Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices
• Improved lower bounds on the connective constants for two-dimensional self-avoiding walks

zbMATH Keywords

triangular latticeself-avoiding walksnumerical application

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Statistical mechanics of polymers (82D60)

Cites Work

• On the Number of Self-Avoiding Walks
• Self-avoiding walks on oriented square lattices
• Lower bound for the connective constant of a self-avoiding walk on a square lattice

Cited In (20)

• Self avoiding walk trees and laces
• New lower bounds on the self-avoiding-walk connective constant
• Spatial mixing and the connective constant: optimal bounds
• A general bridge theorem for self-avoiding walks
• The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
• Self-testing algorithms for self-avoiding walks
• Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
• Borel-type bounds for the self-avoiding walk connective constant
• Bounds for the connective constant of the hexagonal lattice
• Self-avoiding walks
• Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion
• Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
• Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices
• Several constants arising in statistical mechanics
• Upper bounds for the connective constant in \(\mathbb Z^d\)
• The Language of Self-Avoiding Walks
• Phase coexistence for the hard-core model on \(\mathbb{Z}^2\)
• Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy
• Monotonicity of the number of self-avoiding walks
• Title not available (Why is that?)

This page was built for publication: Upper Bounds for the Connective Constant of Self-Avoiding Walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4290083)