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^{(1)}_{e-1}$ and type $A^{(1)}_{e}$, which provides a partial categorification of the runner removal theorems.

Authors

Publication Details

Journal
Journal of Algebra
Published
2026-09-01
DOI
https://doi.org/10.1016/j.jalgebra.2026.07.026
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Subdivision and Runner Removal Theorems

Tao Qin
Journal of Algebra
Polynomial and algebraic computation
article

Subdivision and Runner Removal Theorems

Tao Qin
article en

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.

Journal of Algebra
Australian Research Council
Reduced inequalities
Openalex Percentile: Top 79%
Polynomial and algebraic computation
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.