Principal graph stability and the jellyfish algorithm
Operator Algebras
2012-08-09 v1 Quantum Algebra
Abstract
We show that if the principal graph of a subfactor planar algebra of modulus \delta>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.
Cite
@article{arxiv.1208.1564,
title = {Principal graph stability and the jellyfish algorithm},
author = {Stephen Bigelow and David Penneys},
journal= {arXiv preprint arXiv:1208.1564},
year = {2012}
}
Comments
25 pages, many figures