Home Of Combinatorics and Contours
Post
Cancel

Of Combinatorics and Contours

Consider the contour integral

12πiC(1+z)nzk+1dz

where C is a positively oriented circular contour centered at z=0. If we expand the term in the numerator using the binomial theorem, we see that the above integral is

12πiC((n0)++(nk1)zk1+(nk)zk+(nk+1)zk+1++(nn)zn)1zk+1dz.

The coeffcient of the 1/z term is (nk), so it follows that

12πiC(1+z)nzk+1dz=(nk).

The use of this contour integral — and similar integrals — to prove combinatorial identities is known as the Egorychev method, and it can make quick work of difficult identities involving finitie and infinite sums of binomial coefficients. For example, we can easily evaluate the sum

k=0n(nk)2

as follows

k=0n(nk)2=12πiC(1+z)nzk=0n(nk)1zkdz=12πiC(1+z)nz(1+1z)ndz=12πiC(1+z)2nzn+1dz=(2nn).

Hence we have

k=0n(nk)2=(2nn).

Further examples

Lets prove that

k=0nk(nk)2=n(2n1n).

First note that by differentiating

(1+x)n=k=0n(nk)xk

we get

n(1+x)n1=k=0nk(nk)xk1.

Then multiplying each side by x yields

nx(1+x)n1=k=0nk(nk)xk.

Now let n1,

k=0nk(nk)2=k=0nk2πi(nk)C(1+z)nzk+1dz=12πiC(1+z)nzk=0nk(nk)1zkdz=12πiC(1+z)nznz(1+1z)n1dz=n2πiC(1+z)2n1zn+1dz=n(2n1n).

A Fibonacci identity

In order to show that

k=0n(n+k2k)=F2n+1

we may make use of

(nk)=0ifk>n

and Binet’s formula. Let ϕ=(1+5)/2 and ϕ¯=(15)/2, then

k=0n(n+k2k)=k=0(n+k2k)=k=012πiC(1+z)n+kz2k+1dz=12πiC(1+z)nzk=0(1+zz2)kdz=12πiCz(1+z)nz2z1dz,where C encircles the poles at ϕ and ϕ¯=12πiCz(1+z)n(zϕ)(zϕ¯)dz=ϕ(1+ϕ)nϕϕ¯+ϕ¯(1+ϕ¯)nϕ¯ϕ=ϕ(1+ϕ)nϕ¯(1+ϕ¯)n5=ϕϕ2nϕ¯ϕ¯2n5=F2n+1

as was desired.

This post is licensed under CC BY 4.0 by the author.