Related papers: Tensor categories
A general result relating skew monoidal structures and monads is proved. This is applied to quantum categories and bialgebroids. Ordinary categories are monads in the bicategory whose morphisms are spans between sets. Quantum categories…
This is a condensed overview of the formal theory of monads in a 2-category. We also define two double categories of monads in a 2-category, extending Lack and Street's 2-categories of monads.
Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…
Questions of set-theoretic size play an essential role in category theory, especially the distinction between sets and proper classes (or small sets and large sets). There are many different ways to formalize this, and which choice is made…
Braided-enriched monoidal categories were introduced in work of Morrison-Penneys, where they were characterized using braided central functors. Recent work of Kong-Yuan-Zhang-Zheng and Dell extended this characterization to an equivalence…
A finite tensor category is called pointed if all its simple objects are invertible. We find necessary and sufficient conditions for two pointed semisimple categories to be dual to each other with respect to a module category. Whenever the…
We give a rough description of the 'categories' formed by quantum field theories. A few recent mathematical conjectures derived from quantum field theories, some of which are now proven theorems, will be presented in this language.
We denote the monoidal bicategory of two-sided modules (also called profunctors, bimodules and distributors) between categories by $\mathrm{Mod}$; the tensor product is cartesian product of categories. For a groupoid $\scr{G}$, we study the…
This is the first part in a series of papers developing a tensor product theory for modules for a vertex operator algebra. The goal of this theory is to construct a ``vertex tensor category'' structure on the category of modules for a…
A linear Gr-category is a category of finite-dimensional vector spaces graded by a finite group together with natural tensor product. We classify the braided monoidal structures of a class of linear Gr-categories via explicit computations…
We study the construction of tensor products of representations up to homotopy, which are the A-infinity version of ordinary representations. We provide formulas for the construction of tensor products of representations up to homotopy and…
If $\mathcal{C}$ is a cocomplete monoidal category in which tensoring from both sides preserves coequalizers, then the category of monoids over $\mathcal{C}$ is cocomplete. The same holds if $\mathcal{C}$ has regular factorizations and…
The main result of this paper is the construction of a trace and a trace pairing for endomorphisms satisfying suitable conditions in a monoidal category. This construction is a common generalization of the trace for endomorphisms of…
We give a short proof for a well-known formula for the rank of a $G$-crossed braided extension of a modular tensor category.
We develop theory and examples of monoidal functors on tensor categories in positive characteristic that generalise the Frobenius functor from \cite{Os, EOf, Tann}. The latter has proved to be a powerful tool in the ongoing classification…
T*-categories are introduced as a ternary generalization of C*-categories. Their linking C*-categories are constructed and the Gelfand-Naimark representation theorems of Zettl for C*-ternary rings and for W*-ternary rings, are generalized…
The general theory of Grothendieck categories is presented. We systemize the principle methods and results of the theory, showing how these results can be used for studying rings and modules.
A new categorical setting is defined in order to characterize the subrecursive classes belonging to complexity hierarchies. This is achieved by means of coercion functors over a symmetric monoidal category endowed with certain recursion…
Presheaves and nominal sets provide alternative abstract models of sets of syntactic objects with free and bound variables, such as lambda-terms. One distinguishing feature of the presheaf-based perspective is its elegant syntax-free…
We define convexity canonically in the setting of monoids. We show that many classical results from convex analysis hold for functions defined on such groups and semigroups, rather than only on vector spaces. Some examples and…