Speaker
Elena Di Lavore, Tallinn University of Technology
Title
Monoidal Width
Abstract
Monoidal width measures the structural complexity of morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, monoidal width is based on a notion of syntactic decomposition: a monoidal decomposition of a morphism is an expression that specifies this morphism in the language of monoidal categories, where operations are monoidal products and compositions. We show that, by choosing the correct categorical algebra for decomposing graphs, we can capture tree width and rank width.
