Sums of Multinomial Coefficients

From MaRDI portal





Let \(K_ b(X;n)\) be the Krawtchouk polynomial \(\sum^{n}_{c=0}(-1)^ c\left( \begin{matrix} X\\ c\end{matrix} \right)\left( \begin{matrix} n-X\\ b-c\end{matrix} \right)\). It is easy to compute the values \(K_ b(a;n)\), \(a=0,1,...,n\), by recursion. It is shown that: (1) If \(f(X_ 1,...,X_ n)\) is a symmetric polynomial, then the polynomial obtained by reducing its exponents modulo 2 is \[ 2^{- n}\sum^{n}_{a=0}\{\sum^{n}_{b=0}K_ b(a;n)f(-1,...,- 1,1,...,1)\quad \}S_ a^{(n)}(X_ 1,...,X_ n), \] where the number of -1's in the b'th summand is b and \(S_ a^{(n)}\) is the elementary symmetric polynomial of degree a. (2) \(\sum q!/h_ 1!...h_ n!\) with \(h_ 1+...+h_ n=q\), the first a \(h_ j's\) odd and the rest even, equals \[ 2^{-n}\sum^{n}_{b=0}K_ b(a;n)(n-2b)^ q. \]











This page was built for publication: Sums of Multinomial Coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724348)