ﻻ يوجد ملخص باللغة العربية
We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm which we used to obtain first examples of so-called non-easy linear categories of partitions. All of the examples that we constructed are proven to be indeed new and non-easy. We interpret some of the new categories in terms of quantum group anticommutative twists.
This work is the first one in a series, in which we develop a mathematical theory of enriched (braided) monoidal categories and their representations. In this work, we introduce the notion of the $E_0$-center ($E_1$-center or $E_2$-center) of an enri
We introduce a notion of $n$-commutativity ($0le nle 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 commutative cosimplicial
A braided monoidal category may be considered a $3$-category with one object and one $1$-morphism. In this paper, we show that, more generally, $3$-categories with one object and $1$-morphisms given by elements of a group $G$ correspond to $G$-crosse
It is well-known that the pre-2-category $mathscr{C}at_mathrm{dg}^mathrm{coh}(k)$ of small dg categories over a field $k$, with 1-morphisms defined as dg functors, and with 2-morphisms defined as the complexes of coherent natural transformations, fai
We study plane partitions satisfying condition $a_{n+1,m+1}=0$ (this condition is called pit) and asymptotic conditions along three coordinate axes. We find the formulas for generating function of such plane partitions. Such plane partitions label