Borel-type bounds for the self-avoiding walk connective constant

DOI10.1088/1751-8113/43/23/235001MaRDI QIDQ3569964zbMATH OpenOpenAlexFDO

Authors B. Graham

Publication date 22 June 2010

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.5163

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Abstract: Let $mu$ be the self-avoiding walk connective constant on $$. We show that the asymptotic expansion for $$ in powers of $1/(2d)$ satisfies Borel type bounds. This supports the conjecture that the expansion is Borel summable.

Recommendations

• New lower bounds on the self-avoiding-walk connective constant
• Upper Bounds for the Connective Constant of Self-Avoiding Walks
• Lower bound on the connective constant for square lattice self-avoiding walks
• Improved upper bounds for self-avoiding walks in Z^d
• New upper bounds for the connective constants of self-avoiding walks

Cited in

(6)

• A general bridge theorem for self-avoiding walks
• New lower bounds on the self-avoiding-walk connective constant
• Expansion in high dimension for the growth constants of lattice trees and lattice animals
• Expansion for the critical point of site percolation: the first three terms
• Self‐avoiding walk on the hypercube
• Rate of convergence of the critical point of the memory-\( \tau\) self-avoiding walk in dimensions \(d > 4\)

This page was built for publication: Borel-type bounds for the self-avoiding walk connective constant

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