Search

• < Previous
• 1
• Next >

---

Rule Algebras for Adhesive Categories

Nicolas Behr ; Pawel Sobocinski.

We demonstrate that the most well-known approach to rewriting graphical structures, the Double-Pushout (DPO) approach, possesses a notion of sequential compositions of rules along an overlap that is associative in a natural sense. Notably, our results hold in the general setting of&nbsp;[&hellip;]

---

Monoidal Width

Elena Di Lavore ; Paweł Sobociński.

We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic decomposition: a monoidal decomposition of a morphism is an&nbsp;[&hellip;]

---