Related papers: Partialization of categories and inverse braid-per…
This article aims to provide a novel formalization of the concept of computational irreducibility in terms of the exactness of functorial correspondence between a category of data structures and elementary computations and a corresponding…
In this paper we generalise the notion of linearity (in the sense of Lawvere) to a category C equipped with a compatible sum structure and product structure. In this context, any morphism f from an n-fold sum to an n-fold product has a…
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…
Recently, there has been renewed interest in the theory and applications of de Paiva's dialectica categories and their relationship to the category of polynomial functors. Both fall under the theory of generalized polynomial categories,…
For each braided category $\mathcal{C}$ we show that, under mild hypotheses, there is an associated category of "half braided algebras" and their bimodules internal to $\mathcal{C}$ which is not only monoidal but even braided and balanced.…
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of…
We discuss generalised duality theory for monoidal categories and its applications to the categories of exact endofunctors, graded vector spaces, and topological vector spaces.
Given a fibration in groupoids d : D -> I, we define a fibered multicategory as a particular functor p : M -> I, where M has the same objects as D, and its arrows a : X -> Y should be thought of as families of arrows in the multicategory,…
It is shown that the category of \emph{semi-biproducts} of monoids is equivalent to the category of \emph{pseudo-actions}. A semi-biproduct of monoids is a new notion, obtained through generalizing a biproduct of commutative monoids. By…
The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…
Monoids and groupoids are examples of poloids. On the one hand, poloids can be regarded as one-sorted categories; on the other hand, poloids can be represented by partial magmas of partial transformations. In this article, poloids are…
Given a category with a bifunctor and natural isomorphisms for associativity, commutativity and left and right identity we do not assume that extra constraining diagrams hold. We introduce groupoids of coupling trees to describe a version…
The centre of a monoidal category is a braided monoidal category. Monoidal categories are monoidal objects (or pseudomonoids) in the monoidal bicategory of categories. This paper provides a universal construction in a braided monoidal…
We describe an abstract 2-categorical setting to study various notions of polynomial and analytic functors and monads.
In this paper, we introduce PM-mapping class monoids. Braid groups and mapping class groups have many features in common. Similarly to the notion of braid PM-monoid, PM-mapping class monoid is defined. This construction is an analogy of…
In [arXiv:1509.02937], the notion of a module tensor category was introduced as a braided monoidal central functor $F\colon \mathcal{V}\longrightarrow \mathcal{T}$ from a braided monoidal category $\mathcal{V}$ to a monoidal category…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative…
We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results in classification, we…
We explore an alternative definition of unit in a monoidal category originally due to Saavedra: a Saavedra unit is a cancellative idempotent (in a 1-categorical sense). This notion is more economical than the usual notion in terms of…
Let $\mathcal{B}$ be a subcategory of a given category $\mathcal{D}$. Let $\mathcal{B}$ has monoidal structure. In this article, we discuss when can one extend the monoidal structure of $\mathcal{B}$ to $\mathcal{D}$ such that $\mathcal{B}$…