Subdivision and Runner Removal Theorems

We develop a combinatorial framework for the subdivision map – introduced by Maksimau, Mathas and Tubbenhauer – between the KLR(W) algebras of type $A_{e-1}^{(1)}$ and type $A_e^{(1)}$, which provides a partial categorification of the runner removal theorems.