Cycle type and descent set in wreath products (Q1381834): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 15:38, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cycle type and descent set in wreath products |
scientific article |
Statements
Cycle type and descent set in wreath products (English)
0 references
19 July 1998
0 references
This paper investigates the wreath product \(G_n\) of \({\mathbb{Z}}/p{\mathbb{Z}}\) with the symmetric group \(S_n\), viewed as a permutation group on \(\{1,\dots,n\}\times{\mathbb{Z}}/p{\mathbb{Z}}\). After some short introduction into relevant material from representation theory, it is shown that the number of elements \(\sigma\) in \(G_n\) with a prescribed descent set for \(\sigma\) and \(\sigma^{-1}\) can be expressed as a product of two characters of \(G_n\). These results are specialized to the hyperoctahedral group \(B_n\): The number of elements in \(B_n\) having a prescribed descent set and being in a fixed conjugacy class is expressed as a product of two characters. Finally, formulas are given for the generating function of alternating elements of \(B_n\).
0 references
descent sets
0 references
hyperoctahedral group
0 references
symmetric functions
0 references
group representations
0 references
characters
0 references
wreath product
0 references