BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Theoretical computer science seminar
SUMMARY:Diagram rewriting in double categories - Antonin D
elpeuch\, University of Oxford
DTSTART:20191004T100000Z
DTEND:20191004T110000Z
UID:TALK3903AT
URL:/talk/index/3903
DESCRIPTION:Double categories have a rich diagrammatic calculu
s\, where morphisms can be represented by planar g
raphs with designated horizontal and vertical edge
s. The combinatorics of these diagrams have attrac
ted a lot of attention\, in particular to study "p
inwheels"\, a topologically valid diagram forbidde
n by the algebraic definition of double categories
. In this talk\, we show how free double categorie
s relate to free 2-categories. This gives us a sim
ple algorithm to determine if two diagrams in a do
uble category are equivalent\, solving the word pr
oblem for double categories. This also shows how t
o simulate the forbidden pinwheels in a 2-category
.
LOCATION:Computer Science\, The Sloman Lounge (UG)
CONTACT:Jamie Vicary
END:VEVENT
END:VCALENDAR