On Haagerup's list of potential principal graphs of subfactors
classification
🧮 math.OA
math.QA
keywords
principalgraphgraphshaagerupsubfactorsauthorcandidatescase
read the original abstract
We show that any graph, in the sequence given by Haagerup in 1991 as that of candidates of principal graphs of subfactors, is not realized as a principal graph except for the smallest two. This settles the remaining case of a previous work of the first author.
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.