Automorphisms of the bipartite graph planar algebra (Q709293)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Automorphisms of the bipartite graph planar algebra
    scientific article

      Statements

      Automorphisms of the bipartite graph planar algebra (English)
      0 references
      0 references
      18 October 2010
      0 references
      Planar algebras were introduced by \textit{V. F. R. Jones} [``Planar Graphs I'', \url{arXiv:math/9909027}], where he showed that they can arise from a finite index extremal \(II_1\) subfactor. Conversely, Jones laid out a list of conditions a planar algebra must satisfy to guarantee that it becomes the standard invariant of a subfactor. Bipartite graph planar algebras (BGPA) were defined by \textit{V. F. R. Jones} [Ser. Knots Everything 24, 94--117 (2000; Zbl 1021.46047)]. These BGPA's are almost never of subfactor type. In the present paper, the author classifies the automorphism group of a bipartite graph planar algebra and uses this to show that certain planar subalgebras of the BGPA which are obtained as fixed points are subfactor planar algebras. The original definition of BGPA involves a finite bipartite graph. Here, infinite graphs are allowed, with necessary modifications of the definitions. The paper concludes with a large section on examples of subfactor planar algebras obtained from this planar fixed point construction. Some of the examples show that previously known subfactors are of planar fixed point type. There are also new examples, with both finite and infinite depth. For instance, the procedure gives a new method to construct an infinite depth extremal non-irreducible subfactor of index \((1+\sqrt{2})^2\). A continuous family of subfactors with the same principal graphs but different indices is also obtained.
      0 references
      subfactor
      0 references
      planar algebra
      0 references

      Identifiers