2000 character limit reached
Reconstructing Braided Subcategories of $SU(N)_k$
Published 31 Jan 2022 in math.QA and math.CT | (2202.00121v2)
Abstract: Ocneanu rigidity implies that there are finitely many (braided) fusion categories with a given set of fusion rules. While there is no method for determining all such categories up to equivalence, there are a few cases for which can. For example, Kazhdan and Wenzl described all fusion categories with fusion rules isomorphic to those of $SU(N)_k$. In this paper we extend their results to a statement about braided fusion categories, and obtain similar results for certain subcategories of $SU(N)_k$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.