Further equivalent binomial sums

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Binomial coefficients; factorials; (q)-identities (11B65)

Review text

Let \begin{align*} \Omega_m (n) & = \sum_{k=0}^n \binom{mk}{k} \binom{mn-mk}{n-k}, \\ A_m (n) & = \sum_{j=0}^n m^j \binom{nm-j}{n-j}, \\ B_m (n) & = \sum_{j=0}^n (m-1)^j \binom{nm+1}{n-j}, \\ E_m (n) & = \sum_{k=0}^n m^k \binom{mn-k}{mn-n} \frac{(m-1)k(k+1)}{mn-k}, \\ F_m (n) & = \sum_{k=0}^n (m-1)^k \binom{mn+2}{n-k} \frac{(1+k)(2+mk)}{2+mn}. \end{align*} The authors show that these 5 binomial sums all have the same generating function \[ \Omega_m [x] := \sum_{n \geq 0} \Omega_m (n) x^n = \frac{(1+y)^2}{(1+y-my)^2}, \ \text{for \(x = \frac{y}{(1+y)^m}\)}, \] and hence the same value. These sums generalize the ones discovered by \textit{O. G. Ruehr} in the study [``Solutions of Problem E2765, Am. Math. Mon. 87, No. 4, 307--308 (1980)] which was proposed by \textit{N. Kimura} in 1979 [``Elementary Problem E2765, ibid. 86, No. 3, 223 (1979)]. Note that when \(m=2\) we obtain the convolution of the central binomial coefficients: \[ \Omega_2 (n) = \sum_{k=0}^n \binom{2k}{k} \binom{2n-2k}{n-k} = 4^n. \]

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Further equivalent binomial sums

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