You are currently offline. Some features of the site may not work correctly.

Corpus ID: 90262204

Generating linear categories of partitions

@article{Gromada2019GeneratingLC,
title={Generating linear categories of partitions},
author={Daniel Gromada and M. Weber},
journal={arXiv: Category Theory},
year={2019}
}

We present an algorithm for approximating linear categories of partitions (of sets). We report on concrete computer experiments based on this algorithm and how we found new examples of compact matrix quantum groups (so called "non-easy" quantum groups) with it. This also led to further theoretical insights regarding the representation theory of such quantum groups. We interpret some of the new categories constructing anticommutative twists of quantum groups.