arXiv · 1302.5148
An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem
Abstract
We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor.
Explore related subjects
Keep this discovery
Scott Morrison. 2013-10-15. An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem. https://doi.org/10.1112/blms%2Fbdu009
Cite the original work for its findings. Save a collection to share your selection of sources.