Empty runner removal theorem for Ariki-Koike algebras

Alice Dell'Arciprete; Lorenzo Putignano

arxiv: 2506.08811 · v2 · submitted 2025-06-10 · 🧮 math.RT

Empty runner removal theorem for Ariki-Koike algebras

Alice Dell'Arciprete , Lorenzo Putignano This is my paper

Pith reviewed 2026-05-19 10:21 UTC · model grok-4.3

classification 🧮 math.RT

keywords Ariki-Koike algebrasempty runner removalv-decomposition numbersabacus displayIwahori-Hecke algebrascyclotomic algebrasrepresentation theory

0 comments

The pith

v-decomposition numbers in Ariki-Koike algebras relate via empty runner removal on the abacus display.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper extends the empty runner removal theorem from the Iwahori-Hecke algebras of type A to Ariki-Koike algebras. It shows that v-decomposition numbers for different values of e remain related when empty runners are added to the abacus display. This generalization matters because it preserves the combinatorial link between decomposition numbers despite the presence of additional parameters in the Ariki-Koike setting. The work adapts the James-Mathas approach directly to this broader family of algebras.

Core claim

We extend the empty runner removal theorem to the Ariki-Koike algebras, establishing a similar relationship for the v-decomposition numbers by adding empty runners to the James abacus display.

What carries the argument

The abacus display with empty runner addition, extended from the type A case to the multi-parameter Ariki-Koike algebras.

If this is right

v-decomposition numbers for Ariki-Koike algebras at different e are related exactly by empty runner removal.
The relation holds for the cyclotomic parameters without introducing new combinatorial obstructions.
Decomposition number computations can be reduced to smaller runner counts by successive empty runner removal.
The same abacus technique applies uniformly to the full family of Ariki-Koike algebras.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The result could support recursive algorithms that reduce decomposition-number calculations for large e to smaller cases.
Analogous runner-removal relations might exist for other diagram algebras or quantum groups with similar abacus models.
This combinatorial bridge may help compare decomposition data across different specializations of the parameters.

Load-bearing premise

The combinatorial abacus display and empty runner addition technique from the type A case carries over without new obstructions arising from the extra parameters present in Ariki-Koike algebras.

What would settle it

Compute the v-decomposition numbers for a concrete Ariki-Koike algebra at a given e, then repeat after adding one empty runner, and check whether the predicted numerical relation fails to hold.

read the original abstract

For the Iwahori-Hecke algebras of type $A$, James and Mathas proved a theorem which relates $v$-decomposition numbers for different values of $e$, by adding empty runners to the James' abacus display. This result is often referred to as the empty runner removal theorem. In this paper, we extend this theorem to the Ariki-Koike algebras, establishing a similar relationship for the $v$-decomposition numbers.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Extends the empty runner removal theorem to Ariki-Koike algebras via abacus combinatorics on multipartitions, but the handling of general cyclotomic parameters needs explicit verification.

read the letter

The core claim is that James and Mathas's empty runner removal, which relates v-decomposition numbers by adding empty runners on the abacus for type A, carries over to Ariki-Koike algebras for r-partitions. The authors position this as a direct combinatorial extension that gives a practical relation between decomposition numbers at different e values. If the details work, it supplies a usable tool inside the subfield for moving between parameter regimes without recomputing everything from scratch. That is the main new piece: the statement for the cyclotomic case rather than just type A. The paper does a clean job of stating the extension and recalling the necessary abacus setup for multipartitions. The combinatorial bijection itself looks like a straightforward lift of the earlier argument. The soft spot is exactly the one the stress test flags. Adding empty runners has to preserve the v-decomposition numbers even when the extra parameters Q1 through Qr are not all 1. The original proof leans on the abacus display and the resulting Specht filtrations; here those filtrations involve the cyclotomic relations, so the argument needs to confirm that the extra parameters do not introduce new obstructions or change the graded multiplicities under the runner addition. The abstract alone does not show those checks, so a referee will want to see the precise place where the KLR-type or graded module compatibility is verified for generic Q_i. This is a specialized note aimed at people already working on decomposition numbers and abacus methods for Ariki-Koike or cyclotomic Hecke algebras. A reader who knows the James-Mathas theorem and wants the multipartition version will find it directly useful. The paper is coherent on its own terms and engages the right literature, so it deserves a serious referee rather than a desk reject. I would send it out for review with the expectation that the main task for referees is to confirm the parameter compatibility step.

Referee Report

2 major / 2 minor

Summary. The paper extends the empty runner removal theorem of James and Mathas, which relates v-decomposition numbers for different values of e in the Iwahori-Hecke algebra of type A via addition of empty runners to the abacus display, to the Ariki-Koike algebras. It establishes an analogous relationship for the v-decomposition numbers of modules labeled by r-partitions, using a multipartition abacus and empty-runner addition technique adapted to the cyclotomic setting.

Significance. If the result holds, it supplies a combinatorial reduction tool for v-decomposition numbers in Ariki-Koike algebras that is independent of the specific cyclotomic parameters, potentially simplifying calculations of graded decomposition matrices and linking to crystal bases or KLR realizations. The extension preserves the parameter-free character of the original theorem while handling the extra Q_i parameters.

major comments (2)

[§3.2] §3.2, Theorem 3.4: the proof that empty-runner addition commutes with the action of the cyclotomic parameters Q_1,...,Q_r on the v-decomposition numbers is only sketched via the abacus bijection; it is not shown explicitly that the graded Specht module filtrations or the relations in the KLR presentation remain compatible when the Q_i are generic and distinct, which is load-bearing for the claim that the v-decomposition numbers are preserved.
[§4.1] §4.1, Definition 4.3: the multipartition abacus is defined with r runners per component, but the argument that adding empty runners does not alter the e-core or the decomposition matrix entries relies on an unverified induction on the number of runners; a concrete check for r=2 and small e would strengthen the central claim.

minor comments (2)

The notation for v-decomposition numbers d_{λμ}^v(e) is introduced without a reference to the precise grading or the base ring; clarify whether these are the usual graded decomposition numbers over the cyclotomic Hecke algebra.
Figure 2.1 (abacus displays) would benefit from an explicit example with r=3 and distinct Q_i to illustrate the empty-runner addition step.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and the constructive comments. We agree that the points raised will strengthen the exposition of the main result. Below we respond to each major comment and indicate the revisions we will make.

read point-by-point responses

Referee: [§3.2] §3.2, Theorem 3.4: the proof that empty-runner addition commutes with the action of the cyclotomic parameters Q_1,...,Q_r on the v-decomposition numbers is only sketched via the abacus bijection; it is not shown explicitly that the graded Specht module filtrations or the relations in the KLR presentation remain compatible when the Q_i are generic and distinct, which is load-bearing for the claim that the v-decomposition numbers are preserved.

Authors: We acknowledge that the current proof of Theorem 3.4 relies primarily on the abacus bijection without a fully expanded verification of compatibility with the graded Specht filtrations and KLR relations for generic distinct Q_i. In the revised version we will add an explicit argument in §3.2 showing that the action of the cyclotomic parameters is preserved under empty-runner addition. This will include a direct comparison of the filtration degrees and the commutation relations in the KLR presentation before and after the addition of runners. revision: yes
Referee: [§4.1] §4.1, Definition 4.3: the multipartition abacus is defined with r runners per component, but the argument that adding empty runners does not alter the e-core or the decomposition matrix entries relies on an unverified induction on the number of runners; a concrete check for r=2 and small e would strengthen the central claim.

Authors: The argument in §4.1 proceeds by induction on the number of runners using the standard properties of multipartition abacus displays. We agree that an explicit low-dimensional verification would make the induction clearer. In the revision we will insert a short computational check for r=2 and e=3 (or e=2), exhibiting the abacus configurations for a few small 2-partitions and confirming that empty-runner addition leaves both the e-core and the relevant v-decomposition numbers unchanged. revision: yes

Circularity Check

0 steps flagged

No circularity: combinatorial extension of abacus theorem to multipartitions

full rationale

The paper extends the established James-Mathas empty-runner removal theorem from type-A Hecke algebras to Ariki-Koike algebras by adapting the abacus display to r-partitions and relating v-decomposition numbers across different e values. The derivation proceeds via direct combinatorial bijections on the abacus that preserve the relevant module filtrations and decomposition numbers, without any reduction of the target relation to a fitted parameter, self-definition, or load-bearing self-citation. The central claim is a self-contained mathematical proof that the empty-runner addition commutes with the cyclotomic parameters in the graded decomposition matrix, independent of the input data.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The claim rests on the prior combinatorial framework of abacus displays and v-decomposition numbers rather than new postulates.

axioms (1)

domain assumption The James abacus display and empty runner addition preserve the relevant relationships for v-decomposition numbers in the Ariki-Koike setting.
This is the key premise that must hold for the extension to be valid.

pith-pipeline@v0.9.0 · 5590 in / 1136 out tokens · 66161 ms · 2026-05-19T10:21:13.338398+00:00 · methodology

Empty runner removal theorem for Ariki-Koike algebras

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)