Counting self-avoiding walks on the hexagonal lattice
Snapshots of modern mathematics from Oberwolfach
In how many ways can you go for a walk along a lattice grid in such a way that you never meet your own trail? In this snapshot, we describe some combinatorial and statistical aspects of these so-called self-avoiding walks. In particular, we discuss a recent result concerning the number of self-avoiding walks on the hexagonal (“honeycomb”) lattice. In the last part, we briefly hint at the connection to the geometry of long random self-avoiding walks.
If you are interested in translating this Snapshot, please contact us at email@example.com