Dual Murnaghan-Nakayama rule for Hecke algebras in Type A

Abstract

Let λμ be the value of the irreducible character λ of the Hecke algebra of the symmetric group on the conjugacy class of type μ. The usual Murnaghan-Nakayama rule provides an iterative algorithm based on reduction of the lower partition μ. 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 λ. 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).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…