An identity in the theory of partitions (Q1971618): Difference between revisions

The author conjectured in 1998 [cf. Ann. Comb. 2, No. 2, 145-163 (1998; Zbl 0933.33014)] an elementary partition identity encountered in the study of shifted Jack polynomials, a special case of which was proved by R. Simion. Let \(\mu\) be an integer partition of length \(l(\mu)\), \(m_i(\mu)\) the number of parts equal to \(i\), \[ z_\mu= \prod_{i\geq 1} i^{m_i(\mu)} m_i(\mu)!, \] \((a)_n= a(a+ 1)\cdots (a+ n-1)\), and \(\left\langle\begin{smallmatrix} n\\ r\end{smallmatrix}\right\rangle\) the number of ways of choosing \(r\) different cells from the diagram of the partition \(\mu\) taking at least one cell from each row. In this paper the author proves this identity, one version of which is \[ \begin{multlined}\sum_{|\mu|= n} \Biggl(\Biggl\langle\begin{matrix} \mu\\ r\end{matrix}\Biggr\rangle/ z_\mu\Biggr) X^{l(\mu)- 1}\Biggl(\sum^{l(\mu)}_{i= 1} (\mu_i)_s\Biggr)=\\ (s-1)!\begin{pmatrix} n+s-1\\ n-r\end{pmatrix} \Biggl[\begin{pmatrix} X+ r+ s-1\\ r\end{pmatrix}- \begin{pmatrix} X+ r-1\\ r\end{pmatrix}\Biggr].\end{multlined} \] The proof uses generating functions.