Tea time:15:30, Room 707
Abstract:
Self-avoiding walk is a path on a lattice that does not visit the same site more than once. In spite of this simple definition, many of the most basic questions about this model are difficult to resolve in a mathematically rigorous proof. In particular, we do not know how much about how far an n-step self-avoiding walk from its starting point, or even how many such walks there are.
In this talk, we consider nearest-neighbor self-avoiding walk on Z^d lattices. We present various critical exponents that are obeyed from the two-point function. Furthermore, we present the lower bound and upper bound of the number of n-step self-avoiding walk on Z^d lattices as n→∞.
2024-03-25 16:00 ~ 2024-03-25 17:00
陳隆奇教授 (政大應數系)
Room 201, General Building III