BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:d2e16c8431f12d4ec689ad437ac88f62
DTSTAMP:20241103T214603Z
SUMMARY:Prof. Hugo Duminil-Copin: Counting Self-Avoiding Walks on a Lattice
\, from Combinatorics to Physics.
DESCRIPTION:Abstract: A self-avoiding walk (SAW) on a graph is a path whic
h does not visit any vertex twice. In this talk\, we study an enumeration
problem consisting in counting such walks of given lengths. More precisely
\, we will present the proof (obtained jointly with S. Smirnov) of a conje
cture of Nienhuis stating that the number of SAWs of length non the hexago
nal lattice grows like sqrt{2+sqrt 2}^{n+o(n)}. The proof will also shed n
ew light on a very instructive and beautiful phase transition in the geome
tric properties of long SAWs.\nThe talk will be followed by reception in t
he Huxley Common Room (549)
URL:https://www.imperial.ac.uk/events/97115/prof-hugo-duminil-copin-countin
g-self-avoiding-walks-on-a-lattice-from-combinatorics-to-physics/
DTSTART;TZID=Europe/London:20190516T170000
DTEND;TZID=Europe/London:20190516T180000
LOCATION:United Kingdom
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
DTSTART:20190516T170000
TZNAME:BST
TZOFFSETTO:+0100
TZOFFSETFROM:+0100
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR