Related papers: Collages of String Diagrams
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…
We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…
String diagrams are a powerful and intuitive graphical syntax for terms of symmetric monoidal categories (SMCs). They find many applications in computer science and are becoming increasingly relevant in other fields such as physics and…
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…
Prolongations of a group extension can be studied in a more general situation that we call group extensions of the co-type of a crossed module. Cohomology classification of such extensions is obtained by applying the obstruction theory of…
Multiplier bimonoids (or bialgebras) in arbitrary braided monoidal categories are defined. They are shown to possess monoidal categories of comodules and modules. These facts are explained by the structures carried by their induced…
Tape diagrams provide a graphical representation for arrows of rig categories, namely categories equipped with two monoidal structures, $\oplus$ and $\otimes$, where $\otimes$ distributes over $\oplus$. However, their applicability is…
We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…
We characterize virtual double categories of enriched categories, functors, and profunctors by introducing a new notion of double-categorical colimits. Our characterization is strict in the sense that it is up to equivalence between virtual…
Tape diagrams provide a convenient graphical notation for arrows of rig categories, i.e., categories equipped with two monoidal products, $\oplus$ and $\otimes$. In this work, we introduce Kleene-Cartesian rig categories, namely rig…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric…
The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…
Categories are coreflectively embedded in multicategories via the "discrete cocone" construction, the right adjoint being given by the monoid construction. Furthermore, the adjunction lifts to the "cartesian level": preadditive categories…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
We present a Rocq library for monoidal categories, which includes a decision procedure for proving equality of morphisms as well as notations that make it possible to reason as if they were strict, inferring MacLane isomorphims…
We introduce monoidal streams. Monoidal streams are a generalization of causal stream functions, which can be defined in cartesian monoidal categories, to arbitrary symmetric monoidal categories. In the same way that streams provide…
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…
An $n$-sesquicategory is an $n$-globular set with strictly associative and unital composition and whiskering operations, which are however not required to satisfy the Godement interchange laws which hold in $n$-categories. In…
Linear chord diagrams are partitions of $\left[2n\right]$ into $n$ blocks of size two called chords. We refer to a block of the form $\{i,i+1\}$ as a short chord. In this paper, we study the distribution of the number of short chords on the…