Related papers: String diagrams for Strictification and Coherence
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
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…
This paper describes substantial advances in the analysis (parsing) of diagrams using constraint grammars. The addition of set types to the grammar and spatial indexing of the data make it possible to efficiently parse real diagrams of…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
The goal of this paper is to develop a theory of join and slices for strict $\infty$-categories. To any pair of strict $\infty$-categories, we associate a third one that we call their join. This operation is compatible with the usual join…
Regular logic can be regarded as the internal language of regular categories, but the logic itself is generally not given a categorical treatment. In this paper, we understand the syntax and proof rules of regular logic in terms of the free…
Premonoidal and Freyd categories are both generalized by non-cartesian Freyd categories: effectful categories. We construct string diagrams for effectful categories in terms of the string diagrams for a monoidal category with a freely added…
We study track categories (i.e., groupoid-enriched categories) endowed with additive structure similar to that of a 1-truncated DG-category, except that composition is not assumed right linear. We show that if such a track category is right…
Monoidal width was recently introduced by the authors as a measure of the complexity of decomposing morphisms in monoidal categories. We have shown that in a monoidal category of cospans of graphs, monoidal width and its variants can be…
Many definitions of weak and strict $\infty$-categories have been proposed. In this paper we present a definition for $\infty$-categories with strict associators, but which is otherwise fully weak. Our approach is based on the existing type…
In his PhD thesis, Goosen combined the string-net and the generators-and-relations formalisms for arbitrary once-extended 3-dimensional TQFTs. In this paper we work this out in detail for the simplest non-trivial example, where the…
With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Type classes are one of Haskell's most popular features and extend its type system with ad-hoc polymorphism. Since their conception, there were useful features that could not be offered because of the desire to offer two correctness…
In this paper, which is a revised version of the author's PhD thesis, we analyze two different applications of string theory. In the first part, we focus on four dimensional compactifications of Type II string theories preserving N=1…
Tape diagrams provide a convenient notation for arrows of rig categories, i.e., categories equipped with two monoidal products, $\oplus$ and $\otimes$, where $\otimes$ distributes over $\oplus $. In this work, we extend tape diagrams with…
A diagram $\mathcal{D} = (G, l)$ over a monoid $M$ is an oriented graph $G = (V, E)$ endowed with a labeling $l\colon E \to M$. A diagram is commutative if and only if for any two oriented paths with the same endpoints, the products in $M$…
We use the framework of "props" to study electrical circuits, signal-flow diagrams, and bond graphs. A prop is a strict symmetric monoidal category where the objects are natural numbers, with the tensor product of objects given by addition.…
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes…
We use the string diagram calculus to give graphical proofs of the basic results of Etingof, Nikshych and Ostrik on fusion categories. These results include: the quadruple dual is canonically isomorphic to the identity, positivity of the…