2000 character limit reached
An obstruction to subfactor principal graphs from the graph planar algebra embedding theorem
Published 20 Feb 2013 in math.OA and math.QA | (1302.5148v2)
Abstract: We find a new obstruction to the principal graphs of subfactors. It shows that in a certain family of 3-supertransitive principal graphs, there must be a cycle by depth 6, with one exception, the principal graph of the Haagerup subfactor.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.