Kronecker multiplicities in the $(k,\ell)$ hook are polynomially bounded
Representation Theory
2010-11-09 v1
Abstract
The problem of decomposing the Kronecker product of characters is one of the last major open problems in the ordinary representation theory of the symmetric group . Here we prove upper and lower polynomial bounds for the multiplicities of the Kronecker product , where for some fixed and both partitions and are in the hook, and are partitions of , and goes to infinity.
Cite
@article{arxiv.1011.1636,
title = {Kronecker multiplicities in the $(k,\ell)$ hook are polynomially bounded},
author = {Amitai Regev},
journal= {arXiv preprint arXiv:1011.1636},
year = {2010}
}