Let O_25 be the vertex algebraic braided tensor category of finite-length modules for the Virasoro Lie algebra at central charge 25 whose composition factors are the irreducible quotients of reducible Verma modules. We show that O_25 is rigid and that its simple objects generate a semisimple tensor subcategory that is braided tensor equivalent to an abelian 3-cocycle twist of the category of finite-dimensional sl_2-modules. We also show that this sl_2-type subcategory is braid-reversed tensor equivalent to a similar category for the Virasoro algebra at central charge 1. As an application, we construct a simple conformal vertex algebra which contains the Virasoro vertex operator algebra of central charge 25 as a PSL_2(C)-orbifold. We also use our results to study Arakawa's chiral universal centralizer algebra of SL_2 at level -1, showing that it has a symmetric tensor category of representations equivalent to Rep PSL_2(C). This algebra is an extension of the tensor product of Virasoro vertex operator algebras of central charges 1 and 25, analogous to the modified regular representations of the Virasoro algebra constructed earlier for generic central charges by I. Frenkel-Styrkas and I. Frenkel-M. Zhu.
The first author constructed a q-parameterized spherical category $\sC$ over C(q) in [Liu15], whose simple objects are labelled by all Young diagrams. In this paper, we compute closed-form expressions for the fusion rule of $\sC$, using Littlewood-Richardson coefficients, as well as the characters (including a generating function), using symmetric functions with infinite variables.
This paper classifies the Grothendieck rings of complex fusion categories of multiplicity one up to rank six. Among 72 possible fusion rings, 25 ones are filtered out by using categorification criteria. Each of the remaining 47 fusion rings admits a unitary complex categorification. We found 6 new Grothendieck rings, categorified by applying a localization approach of the Pentagon Equation.
Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a general framework. We give a new method to construct graphical quantum error correcting codes on quantized graphs and characterize all optimal ones. We establish a further connection to geometric group theory and construct quantum low-density parity-check stabilizer codes on the Cayley graphs of groups. Their logical qubits can be encoded by the ground states of newly constructed exactly solvable models with translation-invariant local Hamiltonians. Moreover, the Hamiltonian is gapped in the large limit when the underlying group is infinite.