Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SUBFACTORS OF INDEX LESS THAN 5, PART 4: VINES

    https://doi.org/10.1142/S0129167X11007641Cited by:15 (Source: Crossref)

    We eliminate 39 infinite families of possible principal graphs as part of the classification of subfactors up to index 5. A number-theoretic result of Calegari–Morrison–Snyder, generalizing Asaeda–Yasuda, reduces each infinite family to a finite number of cases. We provide algorithms for computing the effective constants that are required for this result, and we obtain 28 possible principal graphs. The Ostrik d-number test and an algebraic integer test reduce this list to seven graphs in the index range (4,5) which actually occur as principal graphs.

    AMSC: 46L37, 18D10