Related papers: Abstract Tensor Systems as Monoidal Categories

We introduce the notion of meromorphic tensor category and illustrate it in several examples. They include representations of quantum affine algebras, chiral algebras of Beilinson and Drinfeld, G-vertex algebras of Borcherds, and…

In this article, we characterize convexity in terms of algebras over a PROP, and establish a tensor-product-like symmetric monoidal structure on the category of convex sets. Using these two structures, and the theory of $\scr{O}$-monoidal…

When designing plans in engineering, it is often necessary to consider attributes associated to objects, e.g. the location of a robot. Our aim in this paper is to incorporate attributes into existing categorical formalisms for planning,…

We exhibit a complete set of identities for CNOT, the symmetric monoidal category generated by the controlled-not gate, the swap gate, and the computational ancillae. We prove that CNOT is a discrete inverse category. Moreover, we prove…

This paper develops a theory of monoidal categories relative to a braided monoidal category, called augmented monoidal categories. For such categories, balanced bimodules are defined using the formalism of balanced functors. The two main…

This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…

Let $V$ be a vertex operator algebra satisfying suitable conditions such that in particular its module category has a natural vertex tensor category structure, and consequently, a natural braided tensor category structure. We prove that the…

In this short note we investigate the process of constructing auto-equivalences of modular tensor categories using invertible objects. We derive conditions on the invertible object for the resulting auto-equivalence to be either monoidal,…

We introduce a notion of $n$-commutativity ($0\le n\le \infty$) for cosimplicial monoids in a symmetric monoidal category ${\bf V}$, where $n=0$ corresponds to just cosimplicial monoids in ${\bf V,}$ while $n=\infty$ corresponds to…

This paper is about skew monoidal tensored V-categories (= skew monoidal hommed V-actegories) and their categories of modules. A module over <M,*,R> is an algebra for the monad T = R * _ on M. We study in detail the skew monoidal structure…

We define the notion of an aligned null direction, a Lorentz-signature analogue of the eigenvector concept that is valid for arbitrary tensor types. The set of aligned null directions is described by a a system of alignment polynomials…

This paper introduces the continuous tensor abstraction, allowing indices to take real-number values (for example, A[3.14]). It also presents continuous tensor algebra expressions, such as C(x,y) = A(x,y) * B(x,y), where indices are defined…

We introduce the concept of cotensor coalgebra for a given bicomodule over a coalgebra in an abelian monoidal category. Under some further conditions we show that such a cotensor coalgebra exists and satisfies a meaningful universal…

These are the lecture notes for a short course on tensor categories. The coverage in these notes is relatively non-technical, focussing on the essential ideas. They are meant to be accessible for beginners, but it is hoped that also some of…

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

In this paper we develop a combinatorial abstraction of tropical linear programming. This generalizes the search for a feasible point of a system of min-plus-inequalities. It is based on the polyhedral properties of triangulations of the…

In this paper, we consider the problem of determining when two tensor networks are equivalent under a heterogeneous change of basis. In particular, to a string diagram in a certain monoidal category (which we call tensor diagrams), we…

We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…

The paper introduces a novel framework based on category theory to enhance the explainability of artificial intelligence systems, particularly focusing on word embeddings. Key topics include the construction of categories $\mathcal{L}_T$…

We introduce regular languages of morphisms in free monoidal categories, with their associated grammars and automata. These subsume the classical theory of regular languages of words and trees, but also open up a much wider class of…