BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Resurgent large genus asymptotics of intersection numbers
DTSTART:20231123T131500
DTEND:20231123T150000
DTSTAMP:20260916T080726Z
UID:451c6804c337609cb4a0e4907a1d7da5ceb84ead677306e9f55ca853
CATEGORIES:Conferences - Seminars
DESCRIPTION:Alessandro Giacchetto (ETZH)\nFactorials can be recursively co
 mputed through their definition\, but the computation gets difficult quite
  quickly when the number of interest gets larger and larger. A workaround 
 is given by Stirling’s approximation: a closed\, asymptotic formula for 
 factorials. A similar (but much more complicated) situation occurs when tr
 ying to compute Witten’s intersection numbers. Virasoro constraints recu
 rsively compute these numbers\, but the computation gets difficult when th
 e genus gets larger and larger. An approximation has been recently proved 
 by Aggarwal by studying the structure of the associated Virasoro constrain
 ts. I will present an alternative proof of Aggarwal’s result based on qu
 antum curves and resurgence. The advantage of this strategy is that it eas
 ily generalises to several problems (such as r-spin intersection numbers\,
  Norbury’s intersection numbers\, etc) and gives higher-order correction
 s. Based on the joint work with B. Eynard\, E. Garcia-Failde\, P. Gregori
 \, and D. Lewański.
LOCATION:MA A1 12 https://plan.epfl.ch/?room==MA%20A1%2012
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR