CALCULATING TWO-STRAND JELLYFISH RELATIONS

作     者：Penneys, David Peters, Emily 

作者机构：Univ Calif Los Angeles Dept Math Los Angeles CA 90095 USA Loyola Univ Dept Math & Stat Chicago IL 60660 USA 

出 版 物：《PACIFIC JOURNAL OF MATHEMATICS》 (Pac. J. Math.)

年 卷 期：2015年第277卷第2期

页      面：463-510页

核心收录：

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

基　　金：Natural Sciences and Engineering Research Council of Canada NSF RTG grant at Northwestern University [DMS-0636646] DOD-DARPA grant [HR0011-12-1-0009] 

主　　题：subfactors planar algebras jellyfish algorithm principal graphs 

摘      要：We construct a 3(Z/4) subfactor using an algorithm which, given generators in a spoke graph planar algebra, computes two-strand jellyfish relations. This subfactor was known to Izumi, but has not previously appeared in the literature. We systematically analyze the space of second annular consequences, adapting Jones treatment of the space of first annular consequences in his quadratic tangles article. This article is the natural followup to two recent articles on spoke subfactor planar algebras and the jellyfish algorithm. Work of Bigelow and Penneys explains the connection between spoke subfactor planar algebras and the jellyfish algorithm, and work of Morrison and Penneys automates the construction of subfactors where both principal graphs are spoke graphs using one-strand jellyfish. This is the published version of arXiv:1308.5197.