A note on generators for finite depth subfactor planar algebras
Vijay Kodiyalam, Srikanth Tupurani

TL;DR
This paper proves that finite depth subfactor planar algebras can be generated by a single element within a specific box size, simplifying their understanding and analysis.
Contribution
It establishes that subfactor planar algebras of finite depth are generated by one element of bounded size, advancing the structural theory of these algebras.
Findings
Finite depth subfactor planar algebras are generated by a single s-box.
The generating s-box size is bounded by min{k+4, 2k}.
Simplifies the analysis of subfactor planar algebras.
Abstract
We show that a subfactor planar algebra of finite depth is generated by a single -box, for .
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
TopicsAdvanced Topics in Algebra · Algebraic structures and combinatorial models
