Self-avoiding walks on the honeycomb lattice

736 views · Published 17 August 2016 · 1:02:26 · Indexed 20 October 2026

Channel: Microsoft Research · 2016 · Science & Technology

Watch on YouTube

We will present the proof of a conjecture of B. Nienhuis on the number of  self-avoiding walks on the honeycomb lattice. More precisely, we will prove  that the connective constant of the lattice equals the square root of (2+\sqrt{2}).  This theorem is the first step towards a deeper understanding of self-avoiding walks. We  will state some conjectures on the scaling-limit behavior of these walks.

More from this channel