BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Category Theory Seminar
SUMMARY:Constructing monoidal theories with open-graphs an
d rewrite categories - Aleks Kissinger\, Universit
y of Oxford
DTSTART;TZID=Europe/London:20110524T141500
DTEND;TZID=Europe/London:20110524T154500
UID:TALK31577AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/31577
DESCRIPTION:In this talk\, I'll define open-graphs\, which are
special kinds of typed directed graphs that are w
ell suiting for constructing free monoidal categor
ies. These are best thought of as discretisations
of polarised topological graphs\, which Joyal and
Street used to formalise graphical languages for m
onoidal categories in 1991. As in topological grap
hs\, edges in open-graphs can be disconnected at o
ne or both ends (forming inputs and outputs) and c
an be connected to themselves (forming circles). H
owever\, unlike topological graphs\, open-graphs a
re discete\, finitary\, and well-suited to computa
tional applications using existing techniques in g
raph rewriting. I'll discuss how rewriting can be
performed using the "double pushout" technique in
the ambient adhesive category of typed graphs and
show how open-graphs modulo certain rewrite system
s can be used to construct free monoidal categorie
s\, PROPs\, and more general monoidal theories. If
there is time\, I'll discuss how we are applying
these techniques to the study\nof many-body quantu
m entanglement.
LOCATION:MR3\, Centre for Mathematical Sciences
CONTACT:Nathan Bowler
END:VEVENT
END:VCALENDAR