Kronecker multiplicities in the (k,ℓ)(k,\ell) hook are polynomially bounded

preprint2010arXivOpen access

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\otimesχ^μ$, where for some fixed kk and ℓ\ell both partitions $\lm$ and μμ are in the (k,ℓ)(k,\ell) hook, $\lm$ and μμ are partitions of nn, and nn goes to infinity.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.