Binomial Coefficients and Generating Functions - Cs.ioc.ee
Binomial Coefficients and Generating Functions - Cs.ioc.ee
Binomial Coefficients and Generating Functions - Cs.ioc.ee
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Sequence m<br />
0<br />
Let’s take sequences<br />
<strong>and</strong><br />
,0,− m<br />
1<br />
,0, m<br />
2<br />
,0,− m<br />
3<br />
,0, m<br />
4<br />
<br />
m m m m<br />
〈 , , ,..., ,...〉 ←→ F (X ) = (1 + x)<br />
0 1 2 n<br />
m<br />
,0,..., <br />
<br />
m m m m<br />
〈 ,− , ,− ,...,(−1)<br />
0 1 2 3<br />
n<br />
<br />
m<br />
,...〉 ←→ G(X ) = (1 − x)<br />
n<br />
m<br />
Then the convolution corresponds to the function (1 − x) m (1 + x) m = (1 − x 2 ) m that<br />
gives the identity of binomial coefficients:<br />
n <br />
m m<br />
∑<br />
(−1)<br />
j=0 j n − j<br />
j = (−1) n/2<br />
<br />
m<br />
[n is even].<br />
n/2