Principal graph stability and the jellyfish algorithm
Abstract
We show that if the principal graph of a subfactor planar algebra of modulus δ>2 is stable for two depths, then it must end in Afinite tails. This result is analogous to Popa's theorem on principal graph stability. We use these theorems to show that an (n-1) supertransitive subfactor planar algebra has jellyfish generators at depth n if and only if its principal graph is a spoke graph.
0
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.