Murnaghan-Nakayama rule and spin bitrace for the Hecke-Clifford Algebra
Abstract
A Pfaffian-type Murnaghan-Nakayama rule is derived for the Hecke-Clifford algebra Hcn based on the Frobenius formula and vertex operators, and this leads to a combinatorial version via the tableaux realization of Schur's Q-functions. As a consequence, a general formula for the irreducible characters ζμ(q) using partition-valued functions is derived. Meanwhile, an iterative formula on the indexing partition via the Pieri rule is also deduced. As applications, some compact formulae of the irreducible characters are given for special partitions and a symmetric property of the irreducible character is found. We also introduce the spin bitrace as the analogue of the bitrace for the Hecke algebra and derive its general combinatorial formula. Tables of irreducible characters are listed for n≤7.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.