09.12.2012 Views

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

Concrete mathematics : a foundation for computer science

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

series explicitly <strong>for</strong> future reference:<br />

= .qy)& = 1-y.<br />

k<br />

5.4 GENERATING FUNCTIONS 2~1<br />

(5.68)<br />

(5%)<br />

(5.70)<br />

(5.71)<br />

(5.72)<br />

(5.73)<br />

The coefficients (y) $ of BZ (z) are called the Catalan numbers C,, because<br />

Eugene Catalan wrote an influential paper about them in the 1830s [46]. The<br />

sequence begins as follows:<br />

n 0 ’ 2 3 4 5 6 7 8 9 10<br />

G 1 1 2 5 14 42 ‘32 429 ‘430 4862 ‘6796<br />

The coefficients of B-1 (z) are essentially the same, but there’s an extra 1 at the<br />

beginning and the other numbers alternate in sign: (1, 1, -1,2, -5,14,. . . ).<br />

Thus BP1 (z) = 1 + zBz(-z). We also have !B 1 (z) = %2(-z) ‘.<br />

Let’s ClOSe this section by deriving an important consequence of (5.72)<br />

and (5.73), a relation that shows further connections between the functions<br />

L!L, (z) and ‘Bz(-z):<br />

B-1 (z)n+’ - (-Z)n+‘B~(-Z)n+’<br />

VTFG<br />

= x (yk)z,<br />

k

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!