Jellyfish partition categories (Q2180611)

For each positive integer \(n\), the author introduces a monoidal category \(\mathcal{JP}(n)\), called the jellyfish partition category, using a generalisation of partition diagrams. This category is equipped with a monoidal functor \(\Psi:\mathcal{JP}(n)\to\operatorname{Rep}(A_n)\), where \(A_n\) is the alternating group on \(n\) letters. The main results are that \(\Psi\) is always full, and that, if \(n>1\), and either the characteristic of the field is zero or greater or equal to \(n\), then \(\Psi\) is faithful. Hence, \(\mathcal{JP}(n)\) is monoidally equivalent to the full subcategory of \(\operatorname{Rep}(A_n)\) whose objects are tensor powers of the natural \(n\)-dimensional permutation representation.