arXiv · 2602.22494
Subdivision and Runner Removal Theorems
Abstract
We develop a combinatorial framework for the subdivision map -- introduced by Maksimau, Mathas and Tubbenhauer -- between the KLR(W) algebras of type $A^{(1)}_{e-1}$ and type $A^{(1)}_{e}$, which provides a partial categorification of the runner removal theorems.
Explore related subjects
Keep this discovery
Tao Qin. 2026-02-26. Subdivision and Runner Removal Theorems. https://arxiv.org/abs/2602.22494
Cite the original work for its findings. Save a collection to share your selection of sources.