Dual Murnaghan-Nakayama rule for Hecke algebras in Type $A$

Naihuan Jing; Ning Liu; Yu Wu

arxiv: 2503.12299 · v2 · submitted 2025-03-16 · 🧮 math.RT · math.CO· math.QA

Dual Murnaghan-Nakayama rule for Hecke algebras in Type A

Naihuan Jing , Ning Liu , Yu Wu This is my paper

Pith reviewed 2026-05-23 00:54 UTC · model grok-4.3

classification 🧮 math.RT math.COmath.QA

keywords dual Murnaghan-Nakayama ruleHecke algebratype Avertex operatorsbrick tabloidsirreducible characterssymmetric group

0 comments

The pith

A dual Murnaghan-Nakayama rule computes Hecke algebra characters of type A by reducing the upper partition λ via vertex operators.

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

The paper develops a dual version of the Murnaghan-Nakayama rule that computes the irreducible character values χ^λ_μ of the Hecke algebra by iteratively reducing the shape partition λ rather than the class partition μ. It constructs this rule using vertex operators and gives an explicit recursive formula based on the combinatorial model of brick tabloids. A sympathetic reader would care because the standard rule reduces μ while this version reduces λ, offering a complementary computational path that may suit different partition shapes or reveal additional structure. The work refines an earlier result by two of the authors.

Core claim

We establish a dual Murnaghan-Nakayama rule for Hecke algebras of type A using vertex operators by applying reduction to the upper partition λ. We formulate an explicit recursion of the dual Murnaghan-Nakayama rule by employing the combinatorial model of brick tabloids, which refines a previous result by two of us.

What carries the argument

Vertex operator construction applied to the upper partition λ, with recursion given by brick tabloids.

Load-bearing premise

The vertex operator construction applied to the upper partition λ produces the correct character values χ^λ_μ.

What would settle it

A direct computation of χ^λ_μ for small partitions λ and μ where the dual recursion produces a value different from both the standard Murnaghan-Nakayama rule and the known character table of the Hecke algebra.

read the original abstract

Let $\chi^{\lambda}_{\mu}$ be the value of the irreducible character $\chi^{\lambda}$ of the Hecke algebra of the symmetric group on the conjugacy class of type $\mu$. The usual Murnaghan-Nakayama rule provides an iterative algorithm based on reduction of the lower partition $\mu$. In this paper, we establish a dual Murnaghan-Nakayama rule for Hecke algebras of type $A$ using vertex operators by applying reduction to the upper partition $\lambda$. We formulate an explicit recursion of the dual Murnaghan-Nakayama rule by employing the combinatorial model of ``brick tabloids", which refines a previous result by two of us (J. Algebra 598 (2022), 24--47).

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

The paper claims a dual MN rule reducing on the upper partition λ via vertex operators and brick tabloids, refining the authors' 2022 work, but the abstract gives no visible checks that it reproduces the actual χ^λ_μ values.

read the letter

The core claim is a dual Murnaghan-Nakayama rule for Hecke algebra characters in type A that reduces the diagram λ instead of the class μ, using vertex operators and a brick tabloid model to write an explicit recursion. This is presented as new relative to the 2022 J. Algebra paper by two of the same authors and to the usual lower-partition MN literature. If the construction works, it supplies an alternative recursive tool for computing the same character values χ^λ_μ. That is the actual novelty here: the upper reduction and the combinatorial refinement of the recursion. The paper does deliver a concrete combinatorial model that could be useful for explicit calculations once the details are checked. The main soft spot is exactly the one flagged in the stress-test note. The abstract asserts that the vertex-operator action on λ produces the correct irreducible character values, but there is no small-case verification, no direct comparison with the ordinary MN rule, and no indication of how the construction behaves when q is generic or specialized to a root of unity. Without that matching, the duality does not automatically hold. Since only the abstract was initially visible and the full proof steps are not reproduced here, soundness cannot be assessed beyond the claim. The derivation is described as independent rather than circular, which is positive, but the central premise still needs explicit confirmation. This is a technical combinatorial extension inside an established program on Hecke characters. Readers who already work with recursive character formulas or vertex-operator methods in type A would get the most out of the explicit recursion. It is not reorganizing the field, but it is a legitimate next step from the authors' prior result. I would send it to a serious referee who knows the MN literature and can check the small cases and the vertex-operator identities; the work is narrow enough that a desk reject is not warranted if the proofs are present and correct.

Referee Report

1 major / 0 minor

Summary. The paper claims to establish a dual Murnaghan-Nakayama rule for irreducible characters χ^λ_μ of the Hecke algebra of the symmetric group (type A) by using vertex operators to perform reduction on the upper partition λ (rather than the usual lower partition μ), and derives an explicit recursion for this dual rule via the combinatorial model of brick tabloids; the result refines an earlier paper by two of the authors.

Significance. If the central construction is verified, the dual rule supplies an alternative recursive algorithm for character values that may simplify certain computations or yield new combinatorial interpretations in the representation theory of Hecke algebras; the use of an independent brick-tabloid model is a concrete strength that could support reproducibility.

major comments (1)

[Main construction (vertex-operator reduction on λ)] The vertex-operator reduction applied to the upper index λ is the load-bearing step that must reproduce the known values of χ^λ_μ. The manuscript asserts that this reduction yields the correct irreducible characters but does not contain an explicit check (e.g., direct comparison with the classical MN rule after q-specialization, or tabulation of small (λ,μ) pairs) confirming that the resulting recursion matches the Hecke character table.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and for recognizing the potential utility of the dual rule and the independent brick-tabloid model. We address the single major comment below.

read point-by-point responses

Referee: [Main construction (vertex-operator reduction on λ)] The vertex-operator reduction applied to the upper index λ is the load-bearing step that must reproduce the known values of χ^λ_μ. The manuscript asserts that this reduction yields the correct irreducible characters but does not contain an explicit check (e.g., direct comparison with the classical MN rule after q-specialization, or tabulation of small (λ,μ) pairs) confirming that the resulting recursion matches the Hecke character table.

Authors: The algebraic construction proceeds by defining the vertex-operator action on the upper index λ so that it satisfies the same characterizing properties (initial conditions on the empty partition and the same branching rules) as the irreducible characters of the Hecke algebra; the brick-tabloid recursion is then derived directly from this operator. While the manuscript therefore contains a complete proof rather than a mere assertion, we agree that an explicit low-degree verification would improve readability. In the revised version we will add a short subsection containing (i) a direct comparison of the q=1 specialization with the classical dual Murnaghan–Nakayama rule and (ii) a table of all pairs with |λ|≤4 that compares the values produced by the new recursion against the known Hecke character table. These additions will make the correctness of the reduction immediately verifiable by direct inspection. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on independent vertex operator and brick tabloid constructions.

full rationale

The abstract describes establishing the dual rule via vertex operators applied to the upper partition and an explicit recursion from the combinatorial brick tabloid model, refining but not depending definitionally on the cited prior result. No equations or steps are shown reducing the claimed character values or recursion to a fitted parameter, self-definition, or unverified self-citation chain. The construction is presented as self-contained against the standard MN rule and Hecke character theory.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard properties of Hecke algebras, their characters, and vertex operators from prior literature in representation theory and symmetric functions; no free parameters, ad-hoc axioms, or new entities are indicated in the abstract.

axioms (2)

domain assumption Standard definition and properties of irreducible characters χ^λ of the Hecke algebra of the symmetric group
Invoked to define the values being computed by the dual rule.
domain assumption Existence and basic properties of vertex operators in the relevant algebraic setting
Used to implement the reduction on the upper partition.

pith-pipeline@v0.9.0 · 5660 in / 1213 out tokens · 51176 ms · 2026-05-23T00:54:50.774148+00:00 · methodology

Dual Murnaghan-Nakayama rule for Hecke algebras in Type A

Core claim

What carries the argument

Load-bearing premise

What would settle it

discussion (0)