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

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

2010-11-07

arxiv.org/abs/1011.1636v1

Mathematics

Representation Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Kronecker multiplicities in the $(k,\ell)$ hook are polynomially bounded does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kronecker multiplicities in the $(k,\ell)$ hook are polynomially bounded, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kronecker multiplicities in the $(k,\ell)$ hook are polynomially bounded will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-245962