On the complexity of computing Kronecker coefficients

Understand

We study the complexity of computing Kronecker coefficients $g(\lambda,\mu,\nu)$.

• We give explicit bounds in terms of the number of parts $\ell$ in the partitions, their largest part size $N$ and the smallest second part $M$ of the three partitions.
• When $M = O(1)$, i.e.
• one of the partitions is hook-like, the bounds are linear in $\log N$, but depend exponentially on $\ell$.