Related papers: Composable Uncertainty in Symmetric Monoidal Categ…
Symmetric monoidal categories (SMCs) are a common framework for reasoning about computation, focusing on the parallel and sequential compositionality of operations. String diagrams are a ubiquitous and powerful tool for reasoning about…
Let $\mathcal{S}$ be a small category, and suppose that we are given two (non-full) subcategories $\mathcal{S}^{sm}$ and $\mathcal{S}^{cl}$ that generate all morphisms of $\mathcal{S}$ under composition in the same way as morphisms of…
This paper introduces the concept of distorted monoidal categories, a generalization of monoidal and braided monoidal categories that supports non-reversible and direction-sensitive tensor structures. Unlike the classical setting, where the…
Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…
One goal of applied category theory is to understand open systems. We compare two ways of describing open systems as cospans equipped with extra data. First, given a functor $L \colon \mathsf{A} \to \mathsf{X}$, a "structured cospan" is a…
Optimizing the design of complex systems requires navigating interdependent decisions, heterogeneous components, and multiple objectives. Our monotone theory of co-design offers a compositional framework for addressing this challenge,…
One goal of applied category theory is to better understand networks appearing throughout science and engineering. Here we introduce "structured cospans" as a way to study networks with inputs and outputs. Given a functor $L \colon…
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
Model predictive control (MPC) is an optimal control technique which involves solving a sequence of constrained optimization problems across a given time horizon. In this paper, we introduce a category theoretic framework for constructing…
We present an unbiased theory of symmetric multicategories, where sequences are replaced by families. To be effective, this approach requires an explicit consideration of indexing and reindexing of objects and arrows, handled by the double…
Skew monoidal categories are monoidal categories with non-invertible `coherence' morphisms. As shown in a previous paper bialgebroids over a ring R can be characterized as the closed skew monoidal structures on the category Mod R in which…
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…
Category theory is a branch of mathematics that provides a formal framework for understanding the relationship between mathematical structures. To this end, a category not only incorporates the data of the desired objects, but also…
A symmetric monoidal category naturally arises as the mathematical structure that organizes physical systems, processes, and composition thereof, both sequentially and in parallel. This structure admits a purely graphical calculus. This…
The basic data for a skew-monoidal category are the same as for a monoidal category, except that the constraint morphisms are no longer required to be invertible. The constraints are given a specific orientation and satisfy Mac Lane's five…
This is an overview of double categories of "open systems": systems that can interact with their environment. We focus on the variable sharing paradigm, where we compose open systems by identifying variables. This paradigm is often…
String diagrams can nicely express numerous computations in symmetric strict monoidal categories (SSMC). To be entirely exact, this is only true for props: the SSMCs whose monoid of objects are free. In this paper, we show a propification…
Recently, there has been renewed interest in the theory and applications of de Paiva's dialectica categories and their relationship to the category of polynomial functors. Both fall under the theory of generalized polynomial categories,…
We consider the problem of symmetrising a neural network along a group homomorphism: given a homomorphism $\varphi : H \to G$, we would like a procedure that converts $H$-equivariant neural networks to $G$-equivariant ones. We formulate…
It is well-known that combinatorial circuits are modeled mathematically by string diagrams in a monoidal category. Given a gate set $\Sigma$, the circuits over $\Sigma$ can be thought of as string diagrams in the free monoidal category…