paper

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)