All Questions
1 question
6
votes
1
answer
216
views
Coloring summands of given n-partition with given weights of colors
Let $\lambda$ and $\sigma$ be partitions of $n$: $\lambda_1+\lambda_2+\cdots+\lambda_l=n$ and $\sigma_1+\sigma_2+\cdots+\sigma_s=n$
Let $M_{\lambda \sigma}$ be the number of ways to colour the parts ...