Table of Contents
Fetching ...

Diagrammatic Categories which arise from Representation Graphs

Ryan Reynolds

TL;DR

This work develops a general framework to produce diagrammatic categories from representation graphs $R(V,G)$ (the McKay quivers) of a group $G$, yielding a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$ whose quotient can be equivalent to the full monoidal subcategory of $G$-mod generated by tensor products of irreducible modules. By introducing the categories $G$-mod$_{irr}$ and $\mathbf{Dgrams}_{R(V,G)}$ and defining the functors $\mathcal{H}_{R(V,G)}$ and its quotient $\overline{\mathcal{H}}$, the paper proves fullness, and under explicit hypotheses, faithfulness and categorical equivalence, thereby providing diagrammatic presentations of irreducible-module subcategories. It highlights concrete instances, including the McKay correspondence with affine Dynkin diagrams, the Temperley–Lieb paradigm for $SU(2)$, and extensions to fusion categories such as Ver$_p$ and Fibonacci categories, illustrating the method's breadth. The results offer a versatile bridge between combinatorial graph data and monoidal/diagrammatic presentations, with potential impact on categorical representation theory and decategorification, and they outline avenues for generalization to broader graph types and fusion frameworks.

Abstract

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit criteria, there is an equivalence of categories between a quotient category of $\mathbf{Dgrams}_{R(V,G)}$ and a full subcategory of $G-\textbf{mod}$ with objects being the tensor products of finitely many irreducible $G$-modules.

Diagrammatic Categories which arise from Representation Graphs

TL;DR

This work develops a general framework to produce diagrammatic categories from representation graphs (the McKay quivers) of a group , yielding a diagrammatic category whose quotient can be equivalent to the full monoidal subcategory of -mod generated by tensor products of irreducible modules. By introducing the categories -mod and and defining the functors and its quotient , the paper proves fullness, and under explicit hypotheses, faithfulness and categorical equivalence, thereby providing diagrammatic presentations of irreducible-module subcategories. It highlights concrete instances, including the McKay correspondence with affine Dynkin diagrams, the Temperley–Lieb paradigm for , and extensions to fusion categories such as Ver and Fibonacci categories, illustrating the method's breadth. The results offer a versatile bridge between combinatorial graph data and monoidal/diagrammatic presentations, with potential impact on categorical representation theory and decategorification, and they outline avenues for generalization to broader graph types and fusion frameworks.

Abstract

The main result of this paper utilizes the representation graph of a group , , and gives a general construction of a diagrammatic category . The proof of the main theorem shows that, given explicit criteria, there is an equivalence of categories between a quotient category of and a full subcategory of with objects being the tensor products of finitely many irreducible -modules.

Paper Structure

This paper contains 11 sections, 16 theorems, 85 equations.

Key Result

Theorem 2.7

Any monoidal category is monoidally equivalent to a strict monoidal category.

Theorems & Definitions (48)

  • Definition 2.1
  • Example 2.2
  • Example 2.3
  • Example 2.4
  • Definition 2.5
  • Definition 2.6
  • Theorem 2.7
  • Example 2.8
  • Theorem 2.9
  • Definition 3.1
  • ...and 38 more