arXiv 1007.05752010-07math-phmath.COmath.MPmath.PR

The connective constant of the honeycomb lattice equals $\sqrt{2+\sqrt2}$

Hugo Duminil-Copin, Stanislav Smirnov

备注：: 11 pages, 4 figures

英文摘要：

We provide the first mathematical proof that the connective constant of the hexagonal lattice is equal to $\sqrt{2+\sqrt 2}$. This value has been derived non rigorously by B. Nienhuis in 1982, using Coulomb gas approach from theoretical physics. Our proof uses a parafermionic observable for the self avoiding walk, which satisfies a half of the discrete Cauchy-Riemann relations. Establishing the other half of the relations (which conjecturally holds in the scaling limit) would also imply convergence of the self-avoiding walk to SLE(8/3).

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Connective constant for a weighted self-avoiding walk on $\mathbb{Z}^2$

We consider a self-avoiding walk on the dual $\mathbb{Z}^2$ lattice. This walk can traverse the same square twice but cannot cross the same edge more than once. The weight of each square visited by the walk depends on the way the walk passes through it and the weight of the whole walk is calculated as a product of these weights. We consider a family of critical weights parametrized by angle $θ\in[\fracπ{3},\frac{2π}{3}]$. For $θ=\fracπ{3}$, this can be mapped to the self-avoiding walk on the honeycomb lattice. The connective constant in this case was proved to be equal to $\sqrt{2+\sqrt{2}}$ b…

2016-01-04math-phmath.COmath.MP

Bounds on connective constants of regular graphs

Bounds are proved for the connective constant μ of an infinite, connected, Δ-regular graph G. The main result is that μ \ge \sqrt{Δ-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker conditions under which it is sharp.

2013-05-01math-phmath.COmath.MP

A numerical adaptation of SAW identities from the honeycomb to other 2D lattices

Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the existence of a parafermionic observable for self-avoiding walks on the honeycomb lattice. Despite the absence of a corresponding observable for SAW on the square and triangular lattices, we show that in the limit of large lattices, some of the consequences observed on the honeycomb lattice persist on other lattices. This permits the accurate estimation, though not a…

2011-10-19cond-mat.stat-mechmath-phmath.MP

The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is $1+\sqrt{2}$

In 2010, Duminil-Copin and Smirnov proved a long-standing conjecture of Nienhuis, made in 1982, that the growth constant of self-avoiding walks on the hexagonal (a.k.a. honeycomb) lattice is $μ=\sqrt{2+\sqrt{2}}.$ A key identity used in that proof was later generalised by Smirnov so as to apply to a general O(n) loop model with $n\in [-2,2]$ (the case $n=0$ corresponding to SAWs). We modify this model by restricting to a half-plane and introducing a surface fugacity $y$ associated with boundary sites (also called surface sites), and obtain a generalisation of Smirnov's identity. The critical v…

2013-09-24cond-mat.stat-mechmath-phmath.CO

Grigorchuk图的连接常数

Connective constants of Grigorchuk graphs

Cambridge University（剑桥大学）

本文研究Grigorchuk群的Cayley图的连接常数，证明其下界大于黄金分割数φ，扩展了关于无限顶点传递立方图连接常数的猜想，并分析了轨道Schreier图的标签序列出现比例。

2026-10-09math-phmath.COmath.GR

Three theorems in discrete random geometry

These notes are focused on three recent results in discrete random geometry, namely: the proof by Duminil-Copin and Smirnov that the connective constant of the hexagonal lattice is \sqrt{2+\sqrt 2}; the proof by the author and Manolescu of the universality of inhomogeneous bond percolation on the square, triangular, and hexagonal lattices; the proof by Beffara and Duminil-Copin that the critical point of the random-cluster model on Z^2 is \sqrt q/(1+\sqrt q). Background information on the relevant random processes is presented on route to these theorems. The emphasis is upon the communication …

2012-01-27math-phmath.MPmath.PR

更多相关论文收起更多论文

The critical surface fugacity of self-avoiding walks on a rotated honeycomb lattice

In a recent paper by Beaton et al, it was proved that a model of self-avoiding walks on the honeycomb lattice, interacting with an impenetrable surface, undergoes an adsorption phase transition when the surface fugacity is $1+\sqrt{2}$. Their proof used a generalisation of an identity obtained by Duminil-Copin and Smirnov, and confirmed a conjecture of Batchelor and Yung. We consider a similar model of self-avoiding walk adsorption on the honeycomb lattice, but with the lattice rotated by $π/2$. For this model there also exists a conjecture for the critical surface fugacity, made in 1998 by Ba…

2013-10-01cond-mat.stat-mechmath-phmath.CO

立方图上的自避游走与局部变换

Self-avoiding walks on cubic graphs and local transformations

University of Connecticut（康涅狄格大学）

本文研究了立方图上自避游走的连通常数问题，通过建立通用替代原理，将已知连通常数的基图转换为新的准转置图，并证明了临界指数的不变性。

2026-02-16math-phmath.COmath.MP

Two-dimensional self-avoiding walks and polymer adsorption: Critical fugacity estimates

Recently Beaton, de Gier and Guttmann proved a conjecture of Batchelor and Yung that the critical fugacity of self-avoiding walks interacting with (alternate) sites on the surface of the honeycomb lattice is $1+\sqrt{2}$. A key identity used in that proof depends on the existence of a parafermionic observable for self-avoiding walks interacting with a surface on the honeycomb lattice. Despite the absence of a corresponding observable for SAW on the square and triangular lattices, we show that in the limit of large lattices, some of the consequences observed for the honeycomb lattice persist ir…

2011-10-31cond-mat.stat-mechmath-phmath.CO

二维相互作用自回避行走：临界温度与指数的新估计

Two-dimensional interacting self-avoiding walks: new estimates for critical temperatures and exponents

College of Science and Engineering, Flinders University（弗林德斯大学科学与工程学院）

本研究采用级数方法首次分析蜂窝晶格及正方晶格上的相互作用自回避行走，给出两种晶格的θ点临界参数新估计，还得到正方晶格桥连与末端附着行走的临界指数，补充了相关理论研究数据。

2020-02-26cond-mat.stat-mechmath-phmath.MP

Lectures on Self-Avoiding Walks

These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the Hammersley--Welsh bound on the number of self-avoiding walks and its consequences for the growth rates of bridges and self-avoiding polygons. A detailed proof that the connective constant on the hexagonal lattice equals $\sqrt{2+\sqrt{2}}$ is then provided. The lace expansion for self-avoiding walks is described, and its use in understanding the critical behaviour …

2012-06-11math-phmath.COmath.MP

蜂窝晶格及其他晶格上随机 Lipschitz 函数的对数离域

Logarithmic delocalization of random Lipschitz functions on honeycomb and other lattices

本文研究平面图上随机 1-Lipschitz 整数函数的离域行为，借助水平集渗流证明蜂窝等晶格在 $1\leq\mathbf{c}\leq2$ 时呈对数变化，并通过 wired FK-Ising 渗流给出有界方差与局域化条件。

2023-09-26math-phmath.MPmath.PR

Proof of Directional Scaling Symmetry in Square and Triangular Lattices with the Concept of Gaussian and Eisenstein Integers

In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the silver ratioλ=\sqrt{2}-1 or the platinum ratioμ=2-\sqrt{3}. Here we give a new proof, simple and straightforward, by using the concept of Gaussian and Eisenstein integers. More importantly, it can be proven that there are infinitely many possibilities for scale symmetry in the square lattice, and one of them is even related to the golden ratioφ=(\sqrt{5}-1)/2 . T…

2014-10-20math-phmath.MP