Kronecker multiplicities in the $(k,\ell)$ hook are polynomially bounded
Author:
- Amitai RegevARAmitai Regev
Preprint
Abstract
The problem of decomposing the Kronecker product of $S_n$ characters is one of the last major open problems in the ordinary representation theory of the symmetric group $S_n$. Here we prove upper and lower polynomial bounds for the multiplicities of the Kronecker product $\chi^\lm\otimes\chi^\mu$, where for some fixed $k$ and $\ell$ both partitions $\lm$ and $\mu$ are in the $(k,\ell)$ hook, $\lm$ and $\mu$ are partitions of $n$, and $n$ goes to infinity.
Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Hook young diagrams with applications to combinatorics and to representations of Lie superalgebrasAdvances in Mathematics, 1987
- Asymptotic values for degrees associated with strips of young diagramsAdvances in Mathematics, 1981
- A variational problem for random Young tableauxAdvances in Mathematics, 1977
- On Recursions Connected With Symmetric Groups ICanadian Journal of Mathematics, 1951