BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/391
DTSTAMP:20230914T125922Z
SUMMARY:Some Mathematical Problems Arising in the Study of Chemical Reactio
 n Networks
DESCRIPTION:Speaker: Murad Banaji (Department of Mathematics\nUniversity of
  Portsmouth\nLion Gate Building\nLion Terrace\nPortsmouth P01 3HF\nUnited 
 Kingdom)\n\nAbstract: \nNetworks of chemical reactions have natural underl
 ying combinatorial structure\, allowing them to be represented as graphs o
 r digraphs\, perhaps with additional vertex or edge colourings/labellings.
  A variety of recent theorems demonstrate that finite computations on thes
 e graphs can determine the allowed dynamics of these systems to a surprisi
 ng extent. For example\, graph computations can lead to claims about the n
 ature\, uniqueness and stability of limit sets\; the monotonicity of semif
 lows\; the possibility of bifurcations\; and so forth. Thus combinatorial 
 approaches are making an increasing contribution to the study of allowed b
 ehaviours in these dynamical systems. I'll present a brief overview of som
 e problems in this area\, how these intersect with certain themes in analy
 sis\, convex geometry and combinatorics\, but also how they suggest new ma
 thematical questions of interest in their own right.\n
URL:https://www.tcs.tifr.res.in/web/events/391
DTSTART;TZID=Asia/Kolkata:20130806T160000
DTEND;TZID=Asia/Kolkata:20130806T170000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR