Related papers: Propification and the Scalable Comonad

In any symmetric monoidal category, the $n$-th (co)equalizer symmetric power of an object $A$ is the (co)equalizer of all the permutations from $A^{\otimes n}$ to itself. If the symmetric monoidal category is $\mathbb{Q}_{\ge 0}$-linear,…

We establish a formal correspondence between resource calculi an appropriate linear multicategories. We consider the cases of (symmetric) representable, symmetric closed and autonomous multicategories. For all these structures, we prove…

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…

\emph{Scalable spaces} are simply connected compact manifolds or finite complexes whose real cohomology algebra embeds in their algebra of (flat) differential forms. This is a rational homotopy invariant property and all scalable spaces are…

We introduce a sound and complete equational theory capturing equivalence of discrete probabilistic programs, that is, programs extended with primitives for Bernoulli distributions and conditioning, to model distributions over finite sets…

Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…

We define a notion of grading of a monoid T in a monoidal category C, relative to a class of morphisms M (which provide a notion of M-subobject). We show that, under reasonable conditions (including that M forms a factorization system),…

Equational reasoning with string diagrams provides an intuitive means of proving equations between morphisms in a symmetric monoidal category. This can be extended to proofs of infinite families of equations using a simple graphical syntax…

Properties of morphisms represented by so-called 'string diagrams' of monoidal categories (and their braided and symmetric derivatives), mainly their resistance in value to isotopic deformation, have made the usage of graphical calculi…

In this paper we introduce a strict monoidal subcategory of the category of matrices, suitable to address a higher representation theoretic analogue of radicals (non-semisimplicity) in ordinary representation theory. We show the extent to…

A differential category is an additive symmetric monoidal category, that is, a symmetric monoidal category enriched over commutative monoids, with an algebra modality, axiomatizing smooth functions, and a deriving transformation on this…

The correspondence between monoidal categories and graphical languages of diagrams has been studied extensively, leading to applications in quantum computing and communication, systems theory, circuit design and more. From the categorical…

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…

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…

Applied category theory provides powerful mathematical tools for modelling processes and their composition. Symmetric monoidal categories, which involve series and parallel composition, are particularly well-suited for describing the…

Coloured PROPs are a generalisation of coloured operads. In this article, we prove the existence of a Dwyer-Kan model structure on the category of small coloured PROPs enriched in a (sufficiently nice) monoidal model category V. This model…

This article gives a solid theoretical grounding to the observation that cubical structures arise naturally when working with parametricity. We claim that cubical models are cofreely parametric. We use categories, lex categories or clans as…

We will show that a multifunction is strictly proto-differentiable at a point of its graph if and only if it is graphically strictly differentiable, i.e., the graph of the multifunction locally coincides, up to a change of coordinates, with…

Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to…

A 1-matrix model is proposed, which nicely interpolates between double-scaling continuum limits of all multimatrix models. The interpolating partition function is always a KP $\tau $-function and always obeys ${\cal L}_{-1}$-constraint and…