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

Scott Morrison

doi:10.1112/blms/bdu009

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

Scott Morrison^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

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.

Original language	English
Pages (from-to)	600-608
Number of pages	9
Journal	Bulletin of the London Mathematical Society
Volume	46
Issue number	3
DOIs	https://doi.org/10.1112/blms/bdu009
Publication status	Published - Jun 2014

Access to Document

10.1112/blms/bdu009

Cite this

@article{140ef34896734d179370535ede246cd3,

title = "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.",

author = "Scott Morrison",

year = "2014",

month = jun,

doi = "10.1112/blms/bdu009",

language = "English",

volume = "46",

pages = "600--608",

journal = "Bulletin of the London Mathematical Society",

issn = "0024-6093",

publisher = "John Wiley \& Sons Ltd.",

number = "3",

}

TY - JOUR

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

AU - Morrison, Scott

PY - 2014/6

Y1 - 2014/6

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84901266326

U2 - 10.1112/blms/bdu009

DO - 10.1112/blms/bdu009

M3 - Article

SN - 0024-6093

VL - 46

SP - 600

EP - 608

JO - Bulletin of the London Mathematical Society

JF - Bulletin of the London Mathematical Society

IS - 3

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this