Related papers: Fusion categories via string diagrams

In work of Fokkinga and Meertens a calculational approach to category theory is developed. The scheme has many merits, but sacrifices useful type information in the move to an equational style of reasoning. By contrast, traditional proofs…

We classify (multi)fusion 2-categories in terms of braided fusion categories and group cohomological data. This classification is homotopy coherent -- we provide an equivalence between the 3-groupoid of (multi)fusion 2-categories up to…

We present a new model of computation, described in terms of monoidal categories. It conforms the Church-Turing Thesis, and captures the same computable functions as the standard models. It provides a succinct categorical interface to most…

We establish a 6-term left exact sequence, involving Galois cohomology of the base field $\mathbb K$, and the Brauer-Picard groupoid of a fusion category. This generalizes a result of Etingof, Nikshych, and Ostrik to the setting where…

Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…

We classify semisimple rigid monoidal categories with two isomorphism classes of simple objects over the field of complex numbers. In the appendix written by P.Etingof it is proved that the number of semisimple Hopf algebras with a given…

We use Gay and Kirby's description of 4-manifolds in terms of trisections and trisection diagrams to define a new 4-manifold invariant. The algebraic data are an indecomposable finite semisimple bimodule category over a pair of spherical…

Ocneanu rigidity implies that there are finitely many (braided) fusion categories with a given set of fusion rules. While there is no method for determining all such categories up to equivalence, there are a few cases for which can. For…

We introduce collages of string diagrams as a diagrammatic syntax for glueing multiple monoidal categories. Collages of string diagrams are interpreted as pointed bimodular profunctors. As the main examples of this technique, we introduce…

Whereas string diagrams for strict monoidal categories are well understood, and have found application in several fields of Computer Science, graphical formalisms for non-strict monoidal categories are far less studied. In this paper, we…

Group-theoretical fusion categories are defined by data concerning finite groups and their cohomology: A finite group $G$ endowed with a three-cocycle $\omega$, and a subgroup $H\subset G$ endowed with a two-cochain whose coboundary is the…

We use string-net models to accomplish a direct, purely two-dimensional, approach to correlators of two-dimensional rational conformal field theories. We obtain concise geometric expressions for the objects describing bulk and boundary…

This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and…

String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…

Unitary fusion categories (UFCs) have gained increased attention due to emerging connections with quantum physics. We consider a fusion rule of the form $q\otimes q \cong \mathbf{1}\oplus\bigoplus^k_{i=1}x_{i}$ in a UFC $\mathcal{C}$, and…

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…

We introduce a string diagram calculus for strict $4$-categories and use it to prove that given a cofinite inclusion of $4$-categorical presentations, the induced restriction functor on mapping spaces to a fixed target strict $4$-category…

The study of abstraction and composition - the focus of category theory - naturally leads to sophisticated diagrams which can encode complex algebraic semantics. Consequently, these diagrams facilitate a clearer visual comprehension of…

Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. Bonchi et al. showed validity of critical pair analysis for…

We construct a long exact sequence computing the obstruction space, pi_1(BrPic(C_0)), to G-graded extensions of a fusion category C_0. The other terms in the sequence can be computed directly from the fusion ring of C_0. We apply our result…