DeepAI AI Chat
Log In Sign Up

Monoidal Width

by   Elena Di Lavore, et al.

We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture existing notions, namely branch width, tree width and path width. Through these and other examples, we propose that monoidal width: (i) is a promising concept that, while capturing known measures, can similarly be instantiated in other settings, avoiding the need for ad-hoc domain-specific definitions and (ii) comes with a general, formal algebraic notion of decomposition using the language of monoidal categories.


page 1

page 2

page 3

page 4


Monoidal Width: Capturing Rank Width

Monoidal width was recently introduced by the authors as a measure of th...

Reconsideration of Tangle and Ultrafilter using Separation and Partition

Tangle is a concept in graph theory that has a dual relationship with br...

Spined categories: generalizing tree-width beyond graphs

We develop a general theory of categories that admit a functorial invari...

From Gauss to Kolmogorov: Localized Measures of Complexity for Ellipses

The Gaussian width is a fundamental quantity in probability, statistics ...

Spatiogram: A phase based directional angular measure and perceptual weighting for ensemble source width

In concert hall studies, inter-aural cross-correlation (IACC), which is ...

Computing directed path-width and directed tree-width of recursively defined digraphs

In this paper we consider the directed path-width and directed tree-widt...

Decidability of Querying First-Order Theories via Countermodels of Finite Width

We propose a generic framework for establishing the decidability of a wi...