Statistical mechanics, structure of matter Percolation and random geometry Theorem
Duminil-Copin–Smirnov theorem
Builds on Connective constantSelf-avoiding walk
Statement
Let be the hexagonal lattice, the infinite planar graph in which every vertex has degree and every face is a regular hexagon. Then the connective constant of is
Remarks
Bernard Nienhuis predicted this value in 1982 with the Coulomb gas method. Hugo Duminil-Copin and Stanislav Smirnov proved it in a paper published in 2012.
Idea of the proof: let , and let be the generating function of self-avoiding walks from a fixed point, where is the length of . The radius of convergence of is , so the claim is that for and . The proof uses a parafermionic observable, a sum over walks in a domain weighted by and by a complex phase given by the winding of . At this observable satisfies a discrete form of half of the Cauchy–Riemann equations, around every vertex. Summing these relations over a trapezoidal domain gives a linear identity between walks ending on the different sides, from which both bounds follow.
Example of the statement at work: since for all , the number of self-avoiding walks of steps from a vertex of is at least .
Going deeper
For a student
The connective constant is not universal: it depends on the lattice, unlike critical exponents. The hexagonal lattice is special because of a discrete holomorphic structure at , the same kind of structure that appears in Smirnov's proof of Cardy's formula. The theorem was a first rigorous confirmation of the Coulomb gas predictions for the self-avoiding walk. The critical exponents of the self-avoiding walk in the plane, such as the growth , are still not proved.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Connective constant concept
- Self-avoiding walk concept
- Duminil-Copin–Smirnov theorem statement
Further reading
About this page
| Tag | FRNXHYX2SH |
|---|---|
| URI | m2://FRNXHYX2SH |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 82B41, 05A16 |
| Status | This copy of the site has no build data. Run m2 status FRNXHYX2SH. |
| About | Connective constant |
| Uses | Connective constant, Self-avoiding walk |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.