All Questions

I am interested in a possible generalization of the following fact from combinatorics: If $n<m$ then there are at least as many ways to partition a set of size $nm$ into $m$ sets each of size $n$ ...

I think this is a natural question but am not sure where to find resources. Consider the possible multisets arising from choosing $n$ times an item from one of $k$ categories. We can represent one ...

It is known that the coefficient of $q^t$ in Gaussian binomial coefficient $\binom{m+n}m_q$ equals the number of permutations of the multiset $\{0^m, 1^n\}$ with $t$ inversions. Is there a closed ...