On classification of modular categories by rank
arXiv:1507.05139
Abstract
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an application, we determine all possible fusion rules for all rank= modular categories and describe the corresponding monoidal equivalence classes.
arXiv admin note: substantial text overlap with arXiv:1310.7050
References in corpus (1)
Cited by in corpus (9)
- On Gauging Symmetry of Modular Categories
- Classification of Rank 5 Premodular Categories
- Classifying three-character RCFTs with Wronskian Index equalling or
- Classification of Metaplectic Modular Categories
- Gapped Phases in (2+1)d with Non-Invertible Symmetries: Part I
- Symmetry enhancement in RCFT
- Hecke Relations, Cosets and the Classification of 2d RCFTs
- Modular data for the extended Haagerup subfactor
- Classification of relations in the Witt group of nondegenerate braided fusion categories