Self-avoiding polygons and walks: counting, joining and closing.
Nov 8, 2017, 03:10 PM - 04:00 PM | 1011 Evans Hall | Happening As Scheduled
Alan Hammond, U.C. Berkeley
Self-avoiding walk of length n on the integer lattice Z^d is the uniform measure on nearest-neighbour walks in Z^d that begin at the origin and are of length n. If such a walk closes, which is to say that the walk's endpoint neighbours the origin, it is natural to complete the missing edge connecting this endpoint and the origin. The result of doing so is a self-avoiding polygon. We investigate...