加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本