Monoidal Width：统一树宽、径宽和枝宽
Monoidal Width: Unifying Tree Width, Path Width and Branch Width
摘要：
我们引入么半群宽度作为幺半范畴中态射分解难度的度量。对于图，我们表明，monoidal宽度和两个变化捕获现有的概念，即分支宽度，树宽度和路径宽度。我们建议，monoidal宽度：（i）是一个很有前途的概念，同时捕获已知的措施，可以类似地在其他设置中实例化，避免了需要特设域特定的定义和（ii）来与一般的，正式的代数概念的分解使用的语言的幺半范畴。
英文摘要：
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. 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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
