Related papers: Completeness of Nominal PROPs

Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…

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…

We define a monad $T_n^{\operatorname{D^s}}$ whose operations are encoded by simple string diagrams and we define $n$-sesquicategories as algebras over this monad. This monad encodes the compositional structure of $n$-dimensional string…

We give an alternate conception of string diagrams as labeled 1-dimensional oriented cobordisms, the operad of which we denote by Cob/O, where O is the set of string labels. The axioms of traced (symmetric monoidal) categories are fully…

Internal categories feature notions of limit and completeness, as originally proposed in the context of the effective topos. This paper sets out the theory of internal completeness in a general context, spelling out the details of the…

There are many category-theoretic notions of algebraic theory, including Lawvere theories, monads, PROPs and operads. The first central notion of this thesis is a common generalisation of these, which we call a proto-theory. In order to…

The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

Let M be a monoidal category endowed with a distinguished class of weak equivalences and with appropriately compatible classifying bundles for monoids and comonoids. We define and study homotopy-invariant notions of normality for maps of…

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…

We enhance the calculus of string diagrams for monoidal categories with hierarchical features in order to capture closed monoidal (and cartesian closed) structure. Using this new syntax we formulate an automatic differentiation algorithm…

The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…

Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates…

This work introduces a general theory of universal pseudomorphisms and develops their connection to diagrammatic coherence. The main results give hypotheses under which pseudomorphism coherence is equivalent to the coherence theory of…

In this paper, we investigate diagrams, namely functors from any small category to a fixed category, and more particularly, their bisimilarity. Initially defined using the theory of open maps of Joyal et al., we prove several equivalent…

We prove that the homotopy theory of monoidal relative categories is equivalent to that of monoidal $\infty$-categories, and likewise in the symmetric monoidal setting. As an application, we give a concise and complete proof of the fact…

Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…

This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…