BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Centre for Mathematical Sciences - ECPv5.4.0.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Centre for Mathematical Sciences
X-ORIGINAL-URL:https://math-sciences.org
X-WR-CALDESC:Events for Centre for Mathematical Sciences
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20170101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20170524T140000
DTEND;TZID=UTC:20170524T150000
DTSTAMP:20230921T201352
CREATED:20170425T134025Z
LAST-MODIFIED:20170513T100434Z
UID:2469-1495634400-1495638000@math-sciences.org
SUMMARY:Fatemeh Mohammadi (Bristol)
DESCRIPTION:Chip-firing game and Riemann-Roch theory for graphs\nTheory of divisors on graphs is analogous to the classical theory for algebraic curves. The combinatorial language in this setting is “chip-firing game” which has been independently introduced in other fields. A divisor on a graph is simply a configuration of dollars (integer numbers) on its vertices. In each step of the chip-firing game we are allowed to select a vertex and then lend one dollar to each of its neighbors\, or borrow one dollar from each of its neighbors. The goal of the chip-firing game is to get all the vertices out of debt. In this setting\, there is a combinatorial analogue of the classical Riemann-Roch theorem. I will explain the mathematical structure arising from this process and how it sits in a more general framework of (graphical) hyperplane arrangements.
URL:https://math-sciences.org/event/fatemeh-mohammadi-bristol/
LOCATION:Room 205\, 2-5\, Kirkby Place\, Plymouth\, PL4 6DT\, United Kingdom
CATEGORIES:Pure Mathematics,Seminars
END:VEVENT
END:VCALENDAR