2000 character limit reached
On characters of wreath products
Published 25 Jul 2021 in math.RT and math.CO | (2107.11899v3)
Abstract: A character identity which relates irreducible character values of the hyperoctahedral group $B_n$ to those of the symmetric group $S_{2n}$ was recently proved by L\"ubeck and Prasad. Their proof is algebraic and involves Lie theory. We present a short combinatorial proof of this identity, as well as a generalization to other wreath products.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.