Full runner removal theorem for Ariki-Koike algebras (Q6612146)

This paper considers the representation theory of the Ariki-Koike algebra. In 2002 \textit{G. James} and \textit{A. Mathas} [J. Algebra 258, No. 2, 599--614 (2002; Zbl 1058.20005)] proved the so called `empty' runner removal theorem in which they relate \(v\)-decomposition numbers of Iwahori-Hecke algebras for different values of \(e\), by adding empty runners to the abacus displays for the labelling partitions. After that, Fayers proves a similar theorem, which involves adding full runners to these abacus displays. In the current paper, the author generalises Fayers' theorem to the Ariki-Koike algebras by adding a runner full of beads in each of their components.