惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

S
SegmentFault 最新的问题
月光博客
月光博客
大猫的无限游戏
大猫的无限游戏
GbyAI
GbyAI
博客园 - 叶小钗
小众软件
小众软件
WordPress大学
WordPress大学
I
InfoQ
Last Week in AI
Last Week in AI
Vercel News
Vercel News
博客园 - Franky
Stack Overflow Blog
Stack Overflow Blog
P
Proofpoint News Feed
A
About on SuperTechFans
Engineering at Meta
Engineering at Meta
腾讯CDC
D
DataBreaches.Net
有赞技术团队
有赞技术团队
宝玉的分享
宝玉的分享
Jina AI
Jina AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
G
Google Developers Blog
V
Visual Studio Blog
酷 壳 – CoolShell
酷 壳 – CoolShell

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Murnaghan-Nakayama rule for the cyclotomic Hecke algebra ...
Naihuan Jing, Ning Liu · 2025-04-26 · via math.CO updates on arXiv.org

We establish a Murnaghan--Nakayama rule for the irreducible characters of the cyclotomic Hecke algebra $\mathscr H_{m,n}(q,u)$ on Shoji's standard elements. Combined with Shoji's determinacy result, our formula provides a direct combinatorial route to the full irreducible character table of $\mathscr H_{m,n}(q,u)$. Our construction is based on our recent multi-parameter Murnaghan--Nakayama rule for Macdonald polynomials and specializes uniformly to several previously known formulas, including those for the complex reflection group of type $G(m,1,n)$ and the Iwahori--Hecke algebras of types $A$ and $B$. In a dual framework, using the vertex operator realization of Schur functions, we also derive a complementary iterative formula for irreducible characters on upper multipartitions, which may be viewed as a dual Murnaghan--Nakayama rule. As applications, we obtain a Regev-type formula and a Lübeck--Prasad--Adin--Roichman-type formula for cyclotomic Hecke algebras, extending the corresponding formulas for the Iwahori--Hecke algebra of type $A$ and the complex reflection group, respectively. We further introduce the notion of multiple bitrace for cyclotomic Hecke algebras and give a general combinatorial formula for the multiple bitrace. As a specialization, this yields the second orthogonality relation for irreducible characters of the complex reflection group $W_{m,n}$. For practical computation, we also include in an appendix a SageMath implementation of our Murnaghan--Nakayama rule, which computes individual character values and the full character table.