Self-avoiding walks on the honeycomb lattice

Speaker  Hugo Duminil-Copin

Host  Yuval Peres

Affiliation  University of Geneva

Duration  01:02:02

Date recorded  30 June 2010

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+√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.

©2010 Microsoft Corporation. All rights reserved.
> Self-avoiding walks on the honeycomb lattice