All Questions
1 question
3
votes
1
answer
336
views
Proof of a combinatorial identity for a sum over partitions of sets giving rise to a symmetric polynomial?
Consider a set $N$ with elements $n_1, n_2, \dots, n_k$ which are distinct integers. Introduce the notation $N_{i=1,2,\dots,s}$ for the $s$ blocks of a set partition of $N$. Consider a supplementary ...
