The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)

From MaRDI portal
Revision as of 05:01, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:431651

DOI10.4007/annals.2012.175.3.14zbMath1253.82012arXiv1007.0575OpenAlexW2964269077WikidataQ59700469 ScholiaQ59700469MaRDI QIDQ431651

Stanislav Smirnov, Hugo Duminil-Copin

Publication date: 29 June 2012

Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)

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




Related Items

Spatial mixing and the connective constant: optimal boundsSelf-avoiding walks and multiple context-free languagesOn the probability that self-avoiding walk ends at a given pointOn multiple SLE for the FK-Ising model\(U_{\mathfrak{q}}(\mathfrak{sl}_3)\) web models: locality, phase diagram and geometrical defectsPlanar random-cluster model: scaling relationsOn the critical parameters of theq≤ 4 random-cluster model on isoradial graphsTwo-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponentsAn isoperimetric inequality for planar triangulationsThe evaluation of two-dimensional lattice sums via Ramanujan's theta functionsClassical length-5 pattern-avoiding permutationsThe language of self-avoiding walksCounting walks by their last erased self-avoiding polygons using sievesMacroscopic loops in the loop \(O(n)\) model at Nienhuis' critical pointSelf-avoiding walk is sub-ballisticMatching measure, Benjamini-Schramm convergence and the monomer-dimer free energySelf-avoiding walks and amenabilitySelf-avoiding walks and the Fisher transformationNon-coincidence of quenched and annealed connective constants on the supercritical planar percolation clusterExcited Brownian motions as limits of excited random walksKPZ relation does not hold for the level lines and \(\hbox {SLE}_\kappa \) flow lines of the Gaussian free fieldAn optimal algorithm to generate extendable self-avoiding walks in arbitrary dimensionSelf‐avoiding walk on the hypercubeSelected Problems in Probability TheoryThe parafermionic observable in SLESelf-avoiding walks of specified lengths on rectangular grid graphsStatistical mechanics of confined polymer networksA stochastic approach to shortcut bridging in programmable matterOn the growth constant for square-lattice self-avoiding walksNote on locality of volume growth rate of graphsWeighted self-avoiding walksConformally invariant scaling limits in planar critical percolationThree theorems in discrete random geometryThe enumeration of prudent polygons by area and its unusual asymptoticsWeakly directed self-avoiding walksA Hopf algebra for counting cyclesThe critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\)Counting all unfolded self-avoiding walks on a finite lattice strip of width threeShifted critical threshold in the loop \(O(n)\) model at arbitrarily small \(n\)Supercritical self-avoiding walks are space-fillingLectures on the Ising and Potts Models on the Hypercubic LatticeSelf-Avoiding Walks and Connective ConstantsDiscrete holomorphicity and integrability in loop models with open boundariesTwo-sided prudent walks: a solvable non-directed model of polymer adsorptionExponential decay in the loop \(O(n)\) model on the hexagonal lattice for \(n > 1\) and \(x<\frac{1}{\sqrt{3}}+\varepsilon (n)\)Continuity of the phase transition for planar random-cluster and Potts models with \({1 \leq q \leq 4}\)Exponential decay of loop lengths in the loop \(\mathrm{O}(n)\) model with large \(n\)Bounds on connective constants of regular graphsA general bridge theorem for self-avoiding walksCubic graphs and the golden meanSelf-avoiding walk on \(\mathbb{Z}^2\) with Yang-Baxter weights: universality of critical fugacity and 2-point functionSelf-avoiding walk on nonunimodular transitive graphsEntropy-driven phase transition in low-temperature antiferromagnetic Potts modelsUnnamed ItemCounting self-avoiding walks on free products of graphsHarry Kesten's work in probability theoryPlanar random-cluster model: fractal properties of the critical phasePositive speed self-avoiding walks on graphs with more than one endSelf-avoiding walk, spin systems and renormalizationBounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertionUnnamed ItemUnnamed ItemConserved currents in the six-vertex and trigonometric solid-on-solid modelsSelf-avoiding walks and polygons crossing a domain on the square and hexagonal lattices



Cites Work