The $\alpha$-induction of Graded Local Conformal Nets
Ziyun Xu

TL;DR
This paper explores the $eta$-induction process for graded local conformal nets, demonstrating its effectiveness in producing braided subfactors and providing a streamlined proof for classifying $N=2$ superconformal nets.
Contribution
It extends the $eta$-induction framework to graded local conformal nets and applies it to simplify the classification of $N=2$ superconformal nets.
Findings
$eta$-induction yields braided subfactors for graded nets
Shorter proof for $N=2$ superconformal net classification
Validation of $eta$-induction's effectiveness in graded contexts
Abstract
The -induction of graded local conformal nets is studied. We show that inclusions of graded local conformal nets give rise to braided subfactors so that the -induction is still effective for graded local conformal nets. As an application, we give a shorter proof of classification of superconformal nets in the discrete series.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques
