English

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 SnS_n characters is one of the last major open problems in the ordinary representation theory of the symmetric group SnS_n. Here we prove upper and lower polynomial bounds for the multiplicities of the Kronecker product χ\lmχμ\chi^\lm\otimes\chi^\mu, where for some fixed kk and \ell both partitions \lm\lm and μ\mu are in the (k,)(k,\ell) hook, \lm\lm and μ\mu are partitions of nn, and nn 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}
}
R2 v1 2026-06-21T16:40:09.356Z