Related papers: Sheet diagrams for bimonoidal categories
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…
Given a small category $I$ and a closed symmetric monoidal category $\mm$, we show that the diagram category $\mm^I$ with the objectwise product is a closed symmetric monoidal category. We then prove that if $I$ is a Reedy category and…
Diagrammatic notation has become a ubiquitous computational tool; early examples include Penrose's graphical notation for tensor calculus, Feynman's diagrams for perturbative quantum field theory, and Cvitanovic's birdtracks for Lie…
We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.
The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…
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…
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…
A symmetric monoidal category is a category equipped with an associative and commutative (binary) product and an object which is the unit for the product. In fact, those properties only hold up to natural isomorphisms which satisfy some…
Multimodal normal incestual systems are investigated in terms of multiple categories. The different sorted composition of operators are exhibited as 2-cells in multiple categories built up from 2-categories giving rise to different axioms.…
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable…
Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…
The category of small 2-categories has two monoidal structures due to John Gray: one biclosed and one closed. We propose a formalisation of the construction of the right internal and internal homs of these monoidal structures.
The content of this paper can be roughly organized into a three-level hierarchy of generality. At the first, most general level, we introduce a new language which allows us to express various categorical structures in a systematic and…
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…
We define two categories of Dirac manifolds, i.e. manifolds with complex Dirac structures. The first notion of maps I call \emph{Dirac maps}, and the category of Dirac manifolds is seen to contain the categories of Poisson and complex…
Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
The monoidal category of Soergel bimodules can be thought of as a categorification of the Hecke algebra of a finite Weyl group. We present this category, when the Weyl group is the symmetric group, in the language of planar diagrams with…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
We introduce a general diagrammatic theory of digital circuits, based on connections between monoidal categories and graph rewriting. The main achievement of the paper is conceptual, filling a foundational gap in reasoning syntactically and…