Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem

An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Bulletin of the London Mathematical Society Oxford University Press

An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem

An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem

Bulletin of the London Mathematical Society , Volume 46 (3) – Jun 1, 2014

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.

Loading next page...
 
/lp/oxford-university-press/an-obstruction-to-subfactor-principal-graphs-from-the-graph-planar-30VT1kiSbH

References (30)

Publisher
Oxford University Press
Copyright
© 2014 Author
Subject
PAPERS
ISSN
0024-6093
eISSN
1469-2120
DOI
10.1112/blms/bdu009
Publisher site
See Article on Publisher Site

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.

Journal

Bulletin of the London Mathematical SocietyOxford University Press

Published: Jun 1, 2014

There are no references for this article.