arXiv · 1208.1564
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 A_{finite} 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.
Explore related subjects
Keep this discovery
Stephen Bigelow, David Penneys. 2012-08-08. Principal graph stability and the jellyfish algorithm. https://arxiv.org/abs/1208.1564
Cite the original work for its findings. Save a collection to share your selection of sources.