• Connections for small vertex models

    • Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pmsc/110/01/0035-0053

    • Keywords

       

      Subfactor; vertex model; biunitary

    • Abstract

       

      This paper is a first attempt at classifying connections on small vertex models i.e., commuting squares of the form displayed in (1.2) below. More precisely, if we letB(k,n) denote the collection of matricesW for which (1.2) is a commuting square then, we: (i) obtain a simple model form for a representative from each equivalence class inB(2,n), (ii) obtain necessary conditions for two such ‘model connections’ inB(2,n) to be themselves equivalent, (iii) show thatB(2,n) contains a (3n - 6)-parameter family of pairwise inequivalent connections, and (iv) show that the number (3n - 6) is sharp. Finally, we deduce that every graph that can arise as the principal graph of a finite depth subfactor of index 4 actually arises for one arising from a vertex model corresponding toB(2,n) for somen.

    • Author Affiliations

       

      R Srinivasan1

      1. Mehta Research Institute of Mathematics and Mathematical Physics, Allahabad - 211019, India
    • Dates

       
  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2017-2019 Indian Academy of Sciences, Bengaluru.