Combinatorial Identitiy
by utkarshgupta, Jul 29, 2014, 3:22 PM
A nice identity to which I gave a double bijective solution.
Problem: Find
Solution:
Lemma 1
Lemma 2
Lemma 3
Result
Problem: Find

Solution:
Lemma 1
Lemma
:
is the number of ways of writing
as the sum of
s and
s with
and
being counted as distinct.
Proof of Lemma
:
Let
with
occurring
times.
Then obviously
Thus the number of ways of such an ordering (with
s) is 
Thus the total required number of ways are
=







Proof of Lemma

Let



Then obviously

Thus the number of ways of such an ordering (with



Thus the total required number of ways are


Lemma 2
Lemma
:
The number of ways of writing
as the sum of
s and
s (with
and
being counted as distinct) is same as the number of ways of tiling an
grid with tiles of
and 
Proof of Lemma
:
The proof is almost immediate.

The number of ways of writing








Proof of Lemma

The proof is almost immediate.
Lemma 3
Lemma 
the number of ways of tiling an
grid with tiles of
and
is 
Proof of Lemma
:
It is very easy to form the recursion
where
denotes the number of ways of tiling an
grid with tiles of
and
is
.
Analyzing the initial values,


the number of ways of tiling an




Proof of Lemma

It is very easy to form the recursion






Analyzing the initial values,

Result
Combining all these results,
we get

which was to be found
we get

which was to be found