相关论文: Rewriting in higher dimensional linear categories …
Given an algebraic theory which can be described by a (possibly symmetric) operad $P$, we propose a definition of the \emph{weakening} (or \emph{categorification}) of the theory, in which equations that hold strictly for $P$-algebras hold…
We give a definition of weak n-categories based on the theory of operads. We work with operads having an arbitrary set S of types, or `S-operads', and given such an operad O, we denote its set of operations by elt(O). Then for any S-operad…
We develop the theory of semisimplifications of tensor categories defined by Barrett and Westbury. In particular, we compute the semisimplification of the category of representations of a finite group in characteristic $p$ in terms of…
Differential categories were introduced to provide a minimal categorical doctrine for differential linear logic. Here we revisit the formalism and, in particular, examine the two different approaches to defining differentiation which were…
The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. This is related to work of Carmody-Walters on the Todd-Coxeter…
Residuation theory concerns the study of partially ordered algebraic structures, most often monoids, equipped with a weak inverse for the monoidal operator. One of its area of application has been constraint programming, whose key…
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…
Usually a name of the category is inherited from the name of objects. However more relevant for a category of objects and morphisms is an algebra of morphisms. Therefore we prefer to say a category of graphs if every morphism is a graph. In…
We provide explicit and unified formulae for the normalized 3-cocycles on arbitrary finite abelian groups. As an application, we compute all the braided monoidal structures on linear Gr-categories.
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…
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 continue the project begun in ``The periodic table of $n$-categories for low dimensions I'' by examining degenerate tricategories and comparing them with the structures predicted by the Periodic table. For triply degenerate tricategories…
We construct a symmetric monoidal closed category of polynomial endofunctors (as objects) and simulation cells (as morphisms). This structure is defined using universal properties without reference to representing polynomial diagrams and is…
In this article we extend the theory of lax monoidal structures, also known as multitensors, and the monads on categories of enriched graphs that they give rise to. Our first principal result -- the lifting theorem for multitensors --…
A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…
In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic:…
We introduce a new functor category: the category $\mathcal{P}_{d,n}$ of strict polynomial functors with bounded by $n$ domain of degree $d$ over a field of characteristic $p>0$. It is equivalent to the category of finite dimensional…
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…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…
We study certain monoidal subcategories (introduced by David Hernandez and Bernard Leclerc) of finite--dimensional representations of a quantum affine algebra of type $A$. We classify the set of prime representations in these subcategories…