Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1904.00166 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909094534709248 |
|---|---|
| author | Gromada, Daniel Weber, Moritz |
| author_facet | Gromada, Daniel Weber, Moritz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1904_00166 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Generating linear categories of partitions Gromada, Daniel Weber, Moritz Category Theory Quantum Algebra 18D10, 20G42, 68W30 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. |
| title | Generating linear categories of partitions |
| topic | Category Theory Quantum Algebra 18D10, 20G42, 68W30 |
| url | https://arxiv.org/abs/1904.00166 |