Extensions of character formulas by the Littlewood decomposition
Combinatorics
2016-12-13 v1
Abstract
In 2015, the author proved combinatorially character formulas expressing sums of the (formal) dimensions of irreducible representations of symplectic groups, refining some works of Nekrasov and Okounkov, Han, King, and Westbury. In this article, we obtain generalizations of these character formulas, by using a bijection on integer partitions, namely the Littlewood decomposition, for which we prove new properties. As applications, we derive signed generating functions for subsets of integer partitions, and new hook length formulas.
Keywords
Cite
@article{arxiv.1612.03771,
title = {Extensions of character formulas by the Littlewood decomposition},
author = {Mathias Pétréolle},
journal= {arXiv preprint arXiv:1612.03771},
year = {2016}
}
Comments
23 pages, 10 figures. arXiv admin note: text overlap with arXiv:1505.01295