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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

216 BINOMIAL COEFFICIENTS<br />

But look at the lower parameter ‘- 2m’. Negative integers are verboten, so<br />

this identity is undefined!<br />

It’s high time to look at such limiting cases carefully, as promised earlier,<br />

because degenerate hypergeometrics can often be evaluated by approaching<br />

them from nearby nondegenerate points. We must be careful when we do this,<br />

because different results can be obtained if we take limits in different ways.<br />

For example, here are two limits that turn out to be quite different when one<br />

of the upper parameters is increased by c:<br />

hFO F<br />

-lSE, -3<br />

-2+e<br />

-= a,,(l + (4;;k;i + (--1+4(4-3)(-2)<br />

(--2+El(-l+EI2!<br />

+ (-l+~l(~)(l+~l( -3)1-2)(-l)<br />

(-2+E)(-l+E)(E)3! )<br />

FzF(I:';zll) := lii(l+#$+O+O)<br />

:= q+o+o zz -;<br />

Similarly, we have defined (1;) = 0 = lime-c (-2’) ; this is not the same<br />

as lime.+7 (1;::) = 1. The proper way to treat (5.98) as a limit is to realize<br />

that the upper parameter -m is being used to make all terms of the series<br />

tkaO (2c:kk)2k zero <strong>for</strong> k > m; this means that we want to make the following<br />

more precise statement:<br />

(2mm) liiF(y2;,“,12) = 22m, integerm>O. (5.99)<br />

Each term of this limit is well defined, because the denominator factor (-2m)’<br />

does not become zero until k. > 2m. There<strong>for</strong>e this limit gives us exactly the<br />

sum (5.20) we began with.<br />

5.6 HYPERGEOMETRIC TRANSFORMATIONS<br />

It should be clear by now that a database of known hypergeometric<br />

closed <strong>for</strong>ms is a useful tool <strong>for</strong> doing sums of binomial coefficients. We<br />

simply convert any given sum into its canonical hypergeometric <strong>for</strong>m, then<br />

look it up in the table. If it’s there, fine, we’ve got the answer. If not, we can<br />

add it to the database if the sum turns out to be expressible in closed <strong>for</strong>m.<br />

We might also include entries in the table that say, “This sum does not have a<br />

simple closed <strong>for</strong>m in general.” For example, the sum xkSrn (L) corresponds

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

Saved successfully!

Ooh no, something went wrong!