FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
From MaRDI portal
Publication:5735193
DOI10.1093/qmath/13.1.108zbMath0123.00304OpenAlexW2057396406WikidataQ106809811 ScholiaQ106809811MaRDI QIDQ5735193
J. M. Hammersley, Dominic J. A. Welsh
Publication date: 1962
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/13.1.108
Related Items
On the probability that self-avoiding walk ends at a given point ⋮ Copolymeric stars adsorbed at a surface and subject to a force: a self-avoiding walk model ⋮ Force-induced desorption of uniform branched polymers ⋮ Counting all self-avoiding walks on a finite lattice strip of width one and two ⋮ Monotonicity of the number of self-avoiding walks ⋮ Entanglement complexity of graphs in Z3 ⋮ COUNTING ALL SELF-AVOIDING WALKS ON A FINITE LATTICE STRIP OF WIDTH ONE ⋮ End patterns of self-avoiding walks ⋮ Self-avoiding walk is sub-ballistic ⋮ Force-induced desorption of 3-star polymers: a self-avoiding walk model ⋮ Connective constants and height functions for Cayley graphs ⋮ Self-avoiding walks and amenability ⋮ The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. ⋮ Note on locality of volume growth rate of graphs ⋮ Weighted self-avoiding walks ⋮ Weakly self-avoiding walk on a high-dimensional torus ⋮ The escape transition in a self-avoiding walk model of linear polymers ⋮ Lattice stick number of knots ⋮ Self-avoiding walks adsorbed at a surface and pulled at their mid-point ⋮ Three theorems in discrete random geometry ⋮ The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\) ⋮ Annealed scaling for a charged polymer in dimensions two and higher ⋮ Polygons pulled from an adsorbing surface ⋮ Weakly directed self-avoiding walks ⋮ Extendable self-avoiding walks ⋮ The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. ⋮ Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. ⋮ Supercritical self-avoiding walks are space-filling ⋮ Lectures on the Ising and Potts Models on the Hypercubic Lattice ⋮ Self-Avoiding Walks and Connective Constants ⋮ The entropic pressure of a lattice polygon ⋮ The entropic pressure of lattice knots ⋮ New scaling laws for self-avoiding walks: bridges and worms ⋮ Anisotropic self-avoiding walks ⋮ Self-testing algorithms for self-avoiding walks ⋮ The Hammersley-Welsh bound for self-avoiding walk revisited ⋮ Self-avoiding walk in five or more dimensions. I: The critical behaviour ⋮ On the Number of Self-Avoiding Walks ⋮ Polymers with spatial or topological constraints: theoretical and computational results ⋮ Families of \(m\)-convex polygons: \(m=1\) ⋮ A general bridge theorem for self-avoiding walks ⋮ New lower bounds on the self-avoiding-walk connective constant ⋮ Critical behaviour of self-avoiding walk in five or more dimensions ⋮ Self-avoiding walk on \(\mathbb{Z}^2\) with Yang-Baxter weights: universality of critical fugacity and 2-point function ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ Locality of connective constants ⋮ Statistical topology of closed curves: Some applications in polymer physics ⋮ Harry Kesten's work in probability theory ⋮ On self-avoiding polygons and walks: The snake method via pattern fluctuation ⋮ Lattice Polygons and Related Objects ⋮ Interacting Lattice Polygons ⋮ Entanglement complexity of lattice ribbons ⋮ Squeezing knots ⋮ Self-avoiding walk, spin systems and renormalization ⋮ Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion ⋮ Enumeration of three-dimensional convex polygons ⋮ Critical scaling of lattice polymers confined to a box without endpoint restriction ⋮ Self-attracting self-avoiding walk ⋮ Adsorption of lattice polymers with quenched topologies ⋮ Force-induced desorption of uniform block copolymers ⋮ On the existence of critical exponents for self-avoiding walks ⋮ Supermultiplicative relations in models of interacting self-avoiding walks and polygons ⋮ Self-avoiding walks ⋮ On the Number of Self-Avoiding Walks. II
