BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:S. Venkitesh (Indian Institute of Technology Bombay)
DTSTART:20200812T053000Z
DTEND:20200812T063000Z
DTSTAMP:20260423T021406Z
UID:CATGT/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CATGT/4/">A 
 Tour of Chip-firing Games</a>\nby S. Venkitesh (Indian Institute of Techno
 logy Bombay) as part of Applications of Combinatorics in Algebra\, Topolog
 y and Graph Theory\n\n\nAbstract\nThe term `chip-firing' can now be used t
 o refer to any among a plethora of variants of a game\, which\, in its sim
 plest form\, is a discrete dynamical system with chips placed at the verti
 ces of a connected graph\, with the vertices being allowed to fire and sen
 d its chips to its neighbouring vertices\, provided some degree conditions
  are met.  Originating in the work of Bj{\\"o}rner\, Lov{\\'a}sz and Shor 
 (1991) (in the context of graphs) and Bak\, Tang and Weisenfeld (1987) and
  Dhar (1999) (in the context of abelian sandpile models)\, there is now a 
 rich literature on several variants of the game\, spanning both its algebr
 aic and combinatorial aspects.\n\nWe will have an overview of some recent 
 work on `chip-firing'\, with a focus on its combinatorial connections with
  other ideas.\n
LOCATION:https://researchseminars.org/talk/CATGT/4/
END:VEVENT
END:VCALENDAR