Skip to main content
eScholarship
Open Access Publications from the University of California

Combinatorial Theory

Combinatorial Theory banner

On characters of wreath products

Published Web Location

https://doi.org/10.5070/C62257894Creative Commons 'BY' version 4.0 license
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übeck 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.

Mathematics Subject Classifications: 20C30, 20E22, 05E10

Keywords: Character identity, wreath product, partition, Murnaghan-Nakayama rule, colored permutations

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View