Subdivision and Runner Removal Theorems
Representation Theory
2026-02-27 v1 Combinatorics
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.
Cite
@article{arxiv.2602.22494,
title = {Subdivision and Runner Removal Theorems},
author = {Tao Qin},
journal= {arXiv preprint arXiv:2602.22494},
year = {2026}
}
Comments
53 pages; many tikz figures; comments welcome