Generating linear categories of partitions
Abstract
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 socalled noneasy linear categories of partitions. All of the examples that we constructed are proven to be indeed new and noneasy. We interpret some of the new categories in terms of quantum group anticommutative twists.
 Publication:

arXiv eprints
 Pub Date:
 March 2019
 arXiv:
 arXiv:1904.00166
 Bibcode:
 2019arXiv190400166G
 Keywords:

 Mathematics  Category Theory;
 Mathematics  Quantum Algebra;
 18D10;
 20G42;
 68W30
 EPrint:
 41 pages