A Well-Defined Jellyfish Algorithm for the Affine E7 Subfactor Planar Algebra
Abstract
In this paper, we contribute to the Kuperberg program by giving a diagrammatic presentation of generators and relations for the affine E7 unshaded subfactor planar algebra. Using this presentation, we prove that its jellyfish algorithm is a well-defined surjection onto C. In particular, this shows that the jellyfish algorithm is an invariant on closed diagrams for this planar algebra.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.