Subdivision and Runner Removal Theorems
Tao Qin
TL;DR
This paper introduces a combinatorial framework for the subdivision map between KLR(W) algebras of different types, providing a partial categorification of runner removal theorems, advancing understanding in algebraic categorification.
Contribution
It develops a new combinatorial framework for the subdivision map that partially categorifies runner removal theorems in the context of KLR(W) algebras.
Findings
Established a combinatorial framework for the subdivision map
Provided partial categorification of runner removal theorems
Enhanced understanding of algebraic structures in type A^{(1)}_{e-1} and A^{(1)}_{e}
Abstract
We develop a combinatorial framework for the subdivision map -- introduced by Maksimau, Mathas and Tubbenhauer -- between the KLR(W) algebras of type and type , which provides a partial categorification of the runner removal theorems.
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
TopicsPolynomial and algebraic computation · Homotopy and Cohomology in Algebraic Topology · Advanced Combinatorial Mathematics