On the Guionnet-Jones-Shlyakhtenko construction for graphs
Operator Algebras
2010-03-25 v3 Functional Analysis
Abstract
Using an analogue of the Guionnet-Jones-Shlaykhtenko construction for graphs we show that their construction applied to any subfactor planar algebra of finite depth yields an inclusion of interpolated free group factors with finite parameter, thereby giving another proof of their universality for finite depth planar algebras.
Keywords
Cite
@article{arxiv.0911.2047,
title = {On the Guionnet-Jones-Shlyakhtenko construction for graphs},
author = {Vijay Kodiyalam and V. S. Sunder},
journal= {arXiv preprint arXiv:0911.2047},
year = {2010}
}
Comments
42 pages, 12 figures. v2 has updated references and minor changes. v3 corrects some typos.