Diagram rewriting in double categories

Add to your list(s) Download to your calendar using vCal

• Antonin Delpeuch, University of Oxford
• Friday 04 October 2019, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Jamie Vicary.

Double categories have a rich diagrammatic calculus, where morphisms can be represented by planar graphs with designated horizontal and vertical edges. The combinatorics of these diagrams have attracted a lot of attention, in particular to study “pinwheels”, a topologically valid diagram forbidden by the algebraic definition of double categories. In this talk, we show how free double categories relate to free 2-categories. This gives us a simple algorithm to determine if two diagrams in a double category are equivalent, solving the word problem for double categories. This also shows how to simulate the forbidden pinwheels in a 2-category.

This talk is part of the Theoretical computer science seminar series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Theoretical computer science seminar
• computer sience

Note that ex-directory lists are not shown.