Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Murnaghan-Nakayama rule for the cyclotomic Hecke algebra and applications (2504.18825v1)

Published 26 Apr 2025 in math.RT, math.CO, and math.QA

Abstract: We derive a Murnaghan-Nakayama rule for irreducible characters of the cyclotomic Hecke algebra on certain standard elements, which fully determine their values. This work builds upon our recent multi-parameter Murnaghan-Nakayama rule for Macdonald polynomials. Our Murnaghan-Nakayama rule can be readily specialized to retrieve various existing rules, including those for the complex reflection group of type $G(m, 1, n)$ and the Iwahori-Hecke algebra in types $A$ and $B$. In a dual picture, we establish an iterative formula for the irreducible characters on upper multipartitions, utilizing the vertex operator realization of Schur functions. As applications we derive an Regev-type formula and an L\"ubeck-Prasad-Adin-Roichman-type formula for the cyclotomic Hecke algebra, thereby extending the corresponding formulas for the Iwahori-Hecke algebra in type $A$ and the complex reflection group of type $G(m,1,n)$ to the setting of the cyclotomic Hecke algebra, respectively. Finally, we introduce the notion of the multiple bitrace of the cyclotomic Hecke algebra to formulate the second orthogonal relation of the irreducible characters. We also provide a general combinatorial rule to compute the multiple bitrace.

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com