Counting self-avoiding walks on the hexagonal lattice

Snapshots of modern mathematics from Oberwolfach

Counting self-avoiding walks on the hexagonal lattice

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 info@imaginary.org

Mathematical subjects

Probability Theory and Statistics

Author(s)

Hugo Duminil-Copin
Senior Editor:
Sophia Jahns
Junior Editor:
Lara Skuppin

License

DOI (Digital Object Identifier)

10.14760/SNAP-2019-006-EN

Download PDF

PDF

snapshots: overview

Mathematical subjects

Algebra and Number Theory
Analysis
Didactics and Education
Discrete Mathematics and Foundations
Geometry and Topology
Numerics and Scientific Computing
Probability Theory and Statistics

Connections to other fields

Chemistry and Earth Science
Computer Science
Engineering and Technology
Finance
Humanities and Social Sciences
Life Science
Physics
Reflections on Mathematics

These icons are available under the CC BY-SA 4.0 license. Please feel free to use them to classify your own content.
The vector icons can be downloaded here.