2019-08-30: Malin Altenmüller (MSP)

Tue, 14 Oct 2025 16:51:42 +0000

Malin Altenmüller (MSP)

A combinatorial representation of the operad of plane graphs

Abstract

I will present how we can formalise non-symmetric monoidal categories (i.e. string diagrams) in a combinatorial way. These kind of diagrams will be represented by plane graphs with a distinguished boundary vertex. For encoding plane graphs it is sufficient to store the order of neighbours for each vertex, called a rotation system. I'll show how to define these sorts of graphs, how to compose them and — together with the right notion of rewriting — how they form an operad.

This is practice for a talk I will give at STRINGS in Birmingham next week.

2019-08-30 11:00:00 UTC
LT1415