A Well-Defined Jellyfish Algorithm for the Affine Subfactor Planar Algebra
arXiv:2601.09003 · doi:10.1016/j.jpaa.2026.108383
Abstract
In this paper, we contribute to the Kuperberg program by giving a diagrammatic presentation of generators and relations for the affine unshaded subfactor planar algebra. Using this presentation, we prove that its jellyfish algorithm is a well-defined surjection onto . In particular, this shows that the jellyfish algorithm is an invariant on closed diagrams for this planar algebra.
arXiv comment57 pages. Fixed error in subsection 4.8. Corrected various typos