A characterisation of indecomposable web-modules over Khovanov-Kuperberg Algebras
Abstract
After shortly recalling the construction of the Khovanov-Kuperberg algebras, we give a characterisation of indecomposable web-modules. It says that a web-module is indecomposable if and only if one can deduce it directly from the Kuperberg bracket (via a Schur lemma argument). The proofs relies on the construction of idempotents given by explicit foams. These foams are encoded by combinatorial data called red graphs. The key point is to show that when, for a web w the Schur lemma does not apply, one can find an appropriate red graph for w.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.