Related papers: Presentations of linear monoidal categories and th…
We introduce monoidal width as a measure of complexity for morphisms in monoidal categories. Inspired by well-known structural width measures for graphs, like tree width and rank width, monoidal width is based on a notion of syntactic…
Pseudoalgebras, introduced in [BDK], are multi-dimensional analogues of conformal algebras, which provide an axiomatic description of the singular part of the operator product expansion. Our main interest in this paper is the pseudoalgebra…
The functor that takes a ring to its category of modules has an adjoint if one remembers the forgetful functor to abelian groups: the endomorphism ring of linear natural transformations. This uses the self-enrichment of the category of…
We prove Heyneman-Radford Theorem in the framework of Monoidal Categories.
We define and study LNL polycategories, which abstract the judgmental structure of classical linear logic with exponentials. Many existing structures can be represented as LNL polycategories, including LNL adjunctions, linear exponential…
An algebraic investigation on bicomplex numbers is carried out here. Particularly matrices and linear maps defined on them are discussed. A new kind of cartesian product, referred to as an idempotent product, is introduced and studied. The…
Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
We give a 3-categorical, purely formal argument explaining why on the category of Kleisli algebras for a lax monoidal monad, and dually on the category of Eilenberg-Moore algebras for an oplax monoidal monad, we always have a natural…
We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorithm that computes the ``principal'' type for a given…
It is proved that MacLane's coherence results for monoidal and symmetric monoidal categories can be extended to some other categories with multiplication; namely, to relevant, affine and cartesian categories. All results are formulated in…
In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…
In this paper, we consider the monoids of all partial endomorphisms, of all partial weak endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms and of all partial strong weak endomorphisms of a star graph…
We show that two constructions yield equivalent braided monoidal categories. The first is topological, based on Legendrian tangles and skein relations, while the second is algebraic, in terms of chain complexes with complete flag and…
In this paper we study the subcategory of finite-length objects of the category of positive level integrable representations of a toroidal Lie algebra. The main goal is to characterize the blocks of the category. In the cases when the…
In this note we show that similar to the classical case the ring of representations of symmetric groups in a tensor derived category is certain ring of symmetric functions. We also show that in the general setting considered here, the Adams…
We show that the canonical equivalences of categories between 2-dimensional (unoriented) topological quantum field theories valued in a symmetric monoidal category and (extended) commutative Frobenius algebras in that symmetric monoidal…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
To formalize calculations in linear algebra for the development of efficient algorithms and a framework suitable for functional programming languages and faster parallelized computations, we adopt an approach that treats elements of linear…
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…