
arXiv: 2408.04921
The paper studies how to compute irreducible characters of the generalized symmetric group $C_k\wr{S}_n$ by iterative algorithms. After reproving the Ariki-Koike version of the Murnaghan-Nakayama rule by vertex algebraic methods, we formulate a new iterative formula for characters of the generalized symmetric group. As applications, we find a numerical relation between the character values of $C_k\wr S_n$ and modular characters of $S_{kn}$.
24 pages; code appended. Updated references
Representation Theory, Combinatorics, Group Theory, FOS: Mathematics, Combinatorics (math.CO), Group Theory (math.GR), Representation Theory (math.RT), Primary: 20C08, Secondary: 05E10, 17B69
Representation Theory, Combinatorics, Group Theory, FOS: Mathematics, Combinatorics (math.CO), Group Theory (math.GR), Representation Theory (math.RT), Primary: 20C08, Secondary: 05E10, 17B69
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
