BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Self-avoiding walks crossing a square and the gerrymander sequence
 .
DTSTART:20240617T130000Z
DTEND:20240617T143000Z
DTSTAMP:20260416T090400Z
UID:indico-event-1210@indico.dfa.unipd.it
DESCRIPTION:Speakers: Tony Guttmann\n\nSelf-avoiding walks crossing a squa
 re and the gerrymander sequence.Tony Guttmann\, School of Mathematics and 
 Statistics\, The University of Melbourne We give an improved algorithm fo
 r the enumeration of self-avoiding walks and polygons withinan N x N squar
 e as well as for SAWs crossing a square. We present some proofs of the  a
 symptotic behaviouras the size N of the square grows\, and then show how o
 ne can numerically estimate the parameters in the asymptoticexpression. We
  then show how the improved algorithm can be adapted to count gerrymander 
 sequences (OEIS A348456)\,and prove that the asymptotics of the gerrymande
 r sequence is similar to that of SAWs crossing a square.\n\nhttps://indico
 .dfa.unipd.it/event/1210/
LOCATION:1/1-2 - Aula "C. Voci" (Dipartimento di Fisica e Astronomia - Edi
 ficio Marzolo)
URL:https://indico.dfa.unipd.it/event/1210/
END:VEVENT
END:VCALENDAR