On the Guionnet-Jones-Shlyakhtenko construction for graphs
classification
🧮 math.OA
math.FA
keywords
constructionfinitedepthgraphsplanaralgebraalgebrasanalogue
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.