On biunitary permutation matrices and some subfactors of index 9

Abstract

This paper is devoted to a study of the subfactors arising from vertex models constructed out of ‘biunitary’ matrices which happen to be permutation matrices. After a discussion on the computation of the higher relative commutants of the associated subfactor (in the members of the tower of Jones’ basic construction), we discuss the principal graphs of these subfactors for small sizes (<inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper N equals k less-than-or-equal-to 3"> <mml:semantics> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:mi>k</mml:mi> <mml:mo>≤</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">N=k \leq 3</mml:annotation> </mml:semantics> </mml:math> </inline-formula>) of the vertex model. Of the 18 possibly inequivalent such biunitary matrices when <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper N equals 3"> <mml:semantics> <mml:mrow> <mml:mi>N</mml:mi> <mml:mo>=</mml:mo> <mml:mn>3</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">N = 3</mml:annotation> </mml:semantics> </mml:math> </inline-formula>, we compute the principal graphs completely in 15 cases, all of which turn out to be finite. In the last section, we prove that two of the three remaining cases lead to subfactors of infinite depth and discuss their principal graphs.

Locations

• Transactions of the American Mathematical Society - View - PDF