BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Chip-firing on graphs and the geometry of Riemann surfaces - Dhruv
  Ranganathan (Cambridge)
DTSTART:20230217T180000Z
DTEND:20230217T190000Z
UID:TALK196177@talks.cam.ac.uk
CONTACT:Yaël Dillies
DESCRIPTION:I will discuss a parallel between two seemingly disparate worl
 ds: Riemann surfaces\, which are objects of complex analysis\, and finite 
 graphs\, which are objects of combinatorics. Often\, a structure on the ge
 ometric side suggests an analogous structure on the combinatorial one. I w
 ill illustrate this principle in one very pleasant example\, where the com
 binatorial structure is known as “chip firing". While the link between t
 he worlds is technical and still somewhat mysterious\, it is powerful enou
 gh to allow one to use combinatorics to deduce geometric consequences. I
 ’ll discuss some of the advances that these tools have brought us in rec
 ent years.
LOCATION:MR2 in the CMS
END:VEVENT
END:VCALENDAR