IMPACT: International Journal of Research in Applied,

Natural and Social Sciences (IMPACT: IJRANSS)

ISSN(P): 2347-4580; ISSN(E): 2321-8851
Vol. 4, Issue 12, Dec 2016, 35-54
Impact Journals

DETERMINANTS BY USING GENERATING FUNCTIONS

MASRESHAW WALLE ABATE
Department of Mathematics, Dilla University, Dilla, Ethiopia

ABSTRACT
As we know, let alone to find the determinant of infinite matrix, it is difficult to find the determinant of some n x
n matrixes by the usual methods like, the cofactor method and Crammers rule. But now we will show how to find the
determinant of some n x n matrices and how to find the determinant of some infinite matrix by using Generating Functions.
In this paper we will consider matrices having 1's on the supper diagonal, 0's on the upper and identical entries on each
diagonal below the supper diagonal. Here we will try how to obtain the determinant of n x n upper left corner sub matrix of
a given infinite matrix by introducing Generating functions of some sequences and how to get a sequence by calculating
the determinant of n x n upper left corner sub matrix of infinite matrix. We will also check the correctness of the
determinant by using Numerical method

KEYWORDS: Infinite Matrix; Determinant of Matrices; Generating Functions; Sequences; Sub Matrix
1. INTRODUCTION
To understand the whole work, it is better to know about a matrix, determinants, Generating functions and some
sequences. So we will discuss these terms before the actual work.
What are Generating Functions?
One of the main tasks in combinatorics is to develop tools for counting. Perhaps, one of the most powerful tools
frequently used in counting is the notion of Generating functions. Generating functions are used to represent sequences
efficiently by coding the terms of a sequence as coefficients of powers of a variable x in a formal power series. Generating
functions can be used to solve many types of counting problems, such as the number of ways to select or distribute objects
of different kinds, subject to a variety of constraints, and the number of ways to make change for a dollar using coins of
different denominations (Discrete Mathematics and Its Applications, Seventh Edition, Kenneth H. Rosen Monmouth
University (and formerly AT&T Laboratories page 537). In mathematics a Generating function is a formal power series
whose coefficients encode information about a sequence {an} that is indexed by the natural number n. Generating functions
can be used to solve determinants of some nxn and then an infinite matrix by relating the terms of the sequence for which
we get a generating function to the determinant of an upper left corner nxn matrix of an infinite matrix.. Even though there
are various types of Generating functions, in this paper, we introduce the idea of ordinary generating functions (OGF) and
look at some ways to manipulate them. Even though we only consider the ordinary Generating functions we will also
define Exponential Generating functions (EGF) in this paper.
We begin with the definition of the generating function for a sequence.

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

36

Masreshaw Walle Abate

Definition
Ordinary generating function (OGF) supposes we are given a sequence a0, a1, the ordinary generating function
(also called OGF) associated with this sequence is the function whose value at x is

. The sequence a0, a1, is called

the coefficients of the generating function. People often drop ordinary and call this the generating function for the
sequence. This is also called a power series because it is the sum of a series whose terms involve powers of x
(CHAPTER 10 Ordinary Generating Functions)
=

I.e Let

defined to be the power series:=

a
r =0

,,

xr =

, is a sequence of numbers. The Generating function for the sequence (

+

) is

+ . .. for Ordinary generating function (OGF)

xr
x
x2
x3
xr
= a0 + a1 + a 2
+ a3
+ .... a r
.... for Exponential Generating function
ii) A(X) = a r
r!
1!
2!
3!
r!
r =0
(EGF).
Some Examples of Generating Functions of Some Sequences
i) 1,1,1,...

1 + x + x 2 + x 3 + ... = x n =
n0

ii)

1,1,

1
is the ordinary Generating function
1 x

1 1 1
xr
x2 x3
, , ,....
= ex = 1+ x +
+
+ .... is its exponential Generating function.
2! 3! 4!
2! 3!
r =0 r!

1+2x+3x2+4x3+=

iii) 1,2, 3, 4,

(1 x )2

is the generating function for counting numbers .

iv) The generating function for the sequence (1, k, k2, k3,), where k is an ordinary constant is
1+kx +k2x2 + k3x3 +=

v) 1,-1, 1,-1,

1
1 kx

1 x + x 2 x 3 + .=

vi) 1, a, a2, a3,

1+ ax + a2 x2 +=

1
1
=
1 ( x) 1 + x

1
1 ax

vii) 1, 0, 1, 0, 1,. 1+ x2 + x4 + x6+.=

1
1 x2

Two Generating functions A(x) and B(x) for the sequence (ar) and (br), respectively are considered equal
(written A(x) = B(x))

ai = bi i N . In considering the summation in a Generating function, we may assume that x

NASS Rating: 3.30 - Articles can be sent to [email protected]

37

Determinants by Using Generating Functions

has been chosen such that the series converges. In fact, we do not have to concern ourselves so much with the questions of
convergence of the series, since we are only interested in the coefficients. Ivan Niven [N] gave an excellent account of the
theory of formal power series that allow us to ignore questions of convergence, so that we can add and multiply formal
power series term by term like polynomials.
The technique of generating function is useful in the study of at least one sequence, that is, the binomial
coefficients.

1.2 OPERATIONS ON GENERATING FUNCTIONS

Let A(x) = a0+a1 x+a2 x2 + a3 x3+... and B(x) = b0+b1 x+b2 x2 + b3 x3+... be the generating functions for the
sequences (ar) and (br) respectively, then
1.2.1 Constant /Scaling/ Rule

ca0, ca1, ca2, ca3... can cA(x).

Proof

ca0, ca1, ca2, ca3... ca0 + ca1x+ca2 x2+ca3x3 +...

=c (a0+a1x+a2x2+a3 x3+... = cA(x)

E.g. If 1,2,3,4,...
=2+4 +6

1+2x+3x2 + 4x3+... =
+8

1
and c=2, we have
(1 x ) 2

+. . . . 2,4,6,8,10,

1.2.2 Addition Rule

A(x)+B(x) is the generating function for the sequence (cr) where cr= ar+ br,
r = 0,1,2,3...
Proof
A(x)+B(x) = (a0+a1x+a2 x2 + a3 x3+...) + (b0+b1x+b2x2 + b3 x3+...)
= ( a0+ b0) + (a1 + b1)x+( a2+ b2)x2 +(a3+ b3.)x3+...
= c0+ c1x + c2x2+ c3x3+...
Where cr= ar+ br, r = 0,1,2,3...
eg. if
=

= 3"

Then A(x) +B(x) =

= 1+2 +4

+8

#=3 1+3 +9

+ 27

1,2,4,8,

= 3 + 9 + 27

+ 81

3,9,27,

1
3
4 9x
4, 11, 31
+
=
1 2 x 1 3x 1 5x + 6 x 2

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

38

Masreshaw Walle Abate

1.2.3. Product Rule

A(x)B(x) = a0b0 + (a0b1+ a1b0 )x +( a0b2+ a1b1 +a2b0)x2....is the generating function for the sequence (cr), where
cr= a0b0 + a1br-1+.... ar-1 b1+ arb0, r = 0,1,2,3,...
Proof
To evaluate the product A(x) B(x) let us use the following table.
Table 1 Product Table

If we follow the arrow, we get the required product

E.g. If A(x)

A(x). B(x) = (

1,2,2,2,

1+ x
1
and B(x) 1, 1, 1,...
then
1 x
1 x

1+ x
1+ x
1
1,3,5,7,9....
)(
)=
1 x 1 x
(1 x )2

Using the product rule we have the following:

(1-x) A(x) is the generating function for the sequence (cr) where
c0 = a0 and cr= ar - ar -1 for all r
&

1 and

Is the generating function for the sequence (cr) where?

cr= a0 +a1+ a2+... + ar for all r.

Remark

x2 x3
xn
+
+ ... +
+ ..... and
since e = 1 + x +
2! 3!
n!
x

ex = 1 x +

x2 x3
xn

+ ... + (1) n
+ .....
2! 3!
n!
NASS Rating: 3.30 - Articles can be sent to [email protected]

39

Determinants by Using Generating Functions

Then we have

e x + ex
x2 x4
+
+ ... = cos x and
=1 +
2
2! 4!

e x ex
x3 x5
+
+ ... = sin x
= x+
2
3! 5!
1.3.4. SHIFT RIGHT RULE
Suppose A (x)

a0, a1, a2...

=> xA(x)

0, a0, a1, a2, ..

=>x2A(x)

0, 0, a0, a1, a2, ..

xmA(x)

0,0,0 ., 0, a0, a1, a2, ..

m-zero

1.2.5. THE DERIVATIVE RULE

If a0, a1, a2...

A(x), then

a1,2a2, 3a3,

A(x)

Proof

a0, a1, a2, A(x) = a0 + a1x + a2 x2 + a3 x3+...

d
dx

A ( x ) = a1+2a2 x + 3a3x2+... = A(x) a1, 2a2, 3a32,...

E.g. 1,1,1,....

d
dx

1
= 1 + x + x2 + x3+= A(x)
1 x

1
1
= 1+2x + 3x2 +... 1, 2, 3, 4... = A(x)

=
2
1 x (1 x )

And x A(x)

0, 1, 2, 3...

(1 x )2

x
(1 + x )

Hence [xA`(x)]` =
(1 x )2 = (1 + x )3 1, 4, 9, 16,... (square number Sequence)

'

Note:'

( Given a generating function A(x) we use'

Ordinary Generating Functions)

( A(x) to denote an, the coefficient of x n ( 270 Chapter 10

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

40

Masreshaw Walle Abate

MATRIX AND DETERMINANTS

Definition
A matrix is a rectangular array of mn quanties aij i = 1,2,3,...., m & in m - rows and n- columns. It is called an m

j = 1,2,3,..., n

n matrix or a matrix of order m n and read as m by n matrix. The numbers aij are called the elements (constituents or
coordinates or entries) of the matrix and we will denote the matrix by {aij} or A. The suffix ij of an element aij indicates
that it occurs in the ith row and jth column. when n=m we call this a square matrix. For a square matrix nxn, if n then
the matrix is called an infinite matrix.

a11

a 21
a
31
In Explicit form A =
.
.

a
n1

a12
a 22
a 32
.
.
an2

a13
a 23
a 33
.
.
a n3

.
.
.
.
.
.

.
.
.
.
.
.

a1n

a2n
a 3n
rows
.
.
a nn
Columns

NOTE
1) If A = {aij}m x n and B= {bij} n x p, and AB =C, then C = {cij} m x p
n

Where cij =

a b
k =1

ij kj

2) For any matrix

a11

a 21
a
A = 31
.
.

a
n1

a12
a 22
a 32
.
.
an2

a13
a 23
a 33
.
.
a n3

.
.
.
.
.
.

.
.
.
.
.
.

a1n

a2n
a 3n
The supper diagonal
.
.
a nn
The main diagonal
Sub diagonal

MATRIX MUITIPLLCATION
Two matrixes A and B are conformable for the product AB when the number of columns in A is equal to the
number of rows in B. If A is an m x n matrix and B is an n x p matrix then their product AB is defined as m x p matrix
whose (ij)

th

element is obtained by multiplying the element of the ith row of A in the corresponding elements of the jth

column of B and summing the products so obtained. So the (ij) th element of the product AB is the inner product of the ith
NASS Rating: 3.30 - Articles can be sent to [email protected]

41

Determinants by Using Generating Functions

row of A and the j th column of B.

DETERMINANTS
Definition
Determinant of a matrix A is a specific real number assigned to A It is denoted by det (A) or

A Or for n > 1 the

determinant of an n x n matrix A= (aij) along the first row is the sum of n-terms of the form + aij det Aij with plus and minus
signs alternating where the entries a11, a12, a13...a1n are from the first row of A.
n

In symbols, det A = a11 det A11 - a12 det A12 +... + (-1)

n+1

a1n det A1n =

(-1)

1+j

a1j A1j and det A1j is the

j =1

determinant of the sub matrix which is obtained by removing the 1st row and the jth column.
Actually det A1j is called the minor of a1j and (-1) 1+j a1j det A1j is called the cofactor of aij.

CRAMERS RULE
Let A be an invertible n x n matrix. For any b in Rn the unique solution x of
Ax = b has entries given by x i =

*+,&- .

replacing column i by the vector b.

*+,&

where i = 1,2, 3,... n and A i (b) is the matrix obtained from A by

Proof
Denote the column of A by a1, a2, a3,... an. and the column of the n x n identity matrix I by e1, e2, e3,... en.
If Ax =b then the definition of matrix multiplication shows that
A Ii (x) = A [e1, e2, e3,... x... en] = [Ae1, Ae2... Ax... Aen ]
= [a1, a2... b... an] = A i (b)
by the multiplicative property of determinants
(det A) det I i (x) = det A i (b)
=> ( detA) X i = det A i (b)
=> X i =

*+,&- .
*+,&

Determinant of a matrix can be obtained by the cofactor method or by using the Cramer's rule. But now we are
Interested to show how to find the determinant of several matrices by using Generating functions.
The matrices whose determinants we will be evaluating have all 1's on the super diagonal, 0s above the supper
diagonal ; and identical entries on each diagonal below the supper diagonal, perhaps with the exception of the first column,

2. DESCRIPTION OF THE METHOD

In this topic we will see how to get a sequence from the given matrix by calculating the determinant of each
upper left nxn square matrices of the given matrix. All matrices in this section will have 1's on the supper,0`s above and
Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

42

Masreshaw Walle Abate

identical entries on each diagonal below, perhaps with the exception of the first column. Hence we will equate the nth term
of the sequence with determinant of each upper left nxn square matrices of the given matrix. We begin with a typical
example as follows
2

2
2

2
Example 1: Suppose
2
A=
2

2
2

.
.

2
0

1
2

0
1

0
0

0
0

0
0

0
0

2
0

1
2

0
1

0
0

0
0

0
0

0
0

0
0

.
.

.
.

.
.

.
.

.
.

. . .

. . .
. . .

0 . . .
0 . . .
.
1 . . .

2 . . .
0 . . .

. . . .
. . . .
0

0
0

be the given matrix with upper left square sub matrices 2 , "

2
2

(1)

2
1
# , 02
2
2

Now we want to evaluate the upper left corner determinants as follows

2
.|2| = 2, 3
2

2
1
3 = 6, 42
2
2

1
2
0

2
0
2
14 = 14, 5
2
2
2

1
2
0
0

0
1
2
0

1
2
0

0
11 ,
2

0
05 = 30,
1
2

where the nth such determinant will be denoted by Dn,n 1

One way to determine say D5 is as follows, consider the system

2
0

0
0

0 0 0 0 a1 2

1 0 0 0 a 2 2
2 1 0 0 a3 = 2

0 2 1 0 a 4 2

0 0 2 1 a5 2

where the right hand side is the first column from the original matrix of (1) for n=5
By crammers rule and properties of determinants, we have

NASS Rating: 3.30 - Articles can be sent to [email protected]

(2)

43

Determinants by Using Generating Functions

1 0 0 0

2 1 0 0 2
0 2 1 0 2
0 0 2 2 2
0 0 0 2 2
= 62 In general by induction we have an = (-1) n-1 Dn.
6 =
1 0 0 0 0

(3)

2 1 0 0 0
0 2 1 0 0
0 0 2 1 0
0 0 0 2 1
Now let us introduce the generating functions for the columns of (1) and rewrite it as (2) we get the system
0
1

x
2x
0 2x 2

0
0

0
0
0
0

.
.
.
.
.
.

0
x2

0
0

0
0

0
0

2x3

x3

x
2x5

0
x5

0
0

2x
0

.
.

.
.

.
.

.
.

. . . a1 2

. . . a 2 2 x
. . . a3 2 x 2

. . . a 4 2 x 3

. . . a5 = 2 x 4
. . . a6 2 x 5

. . . . .
. . . . .

. . . . .

(4)

Then the right hand side has a generating function

.22

+ 2

+. . . =

and except the elements on the main diagonal of the first matrix of left side of (4),
The first column has a generating function C(x) = 2x
The 2nd column has a generating function xC(x) = 2x2
The 3rd column has a generating function x2C(x) = 2x3
Letting A(x) = a 1+a2 x+a3 x2... as the generating function for the sequence a1, a2, a3,... and summing on both
sides of (4) we get
A(x) +

C(x)+a2 xC(x)+a3 x2 C(x) +... = 2

=> A(x) + C(x) (a 1 + a2 x+a3 x2 +...) =

=> A(x) + A(x) C(x) =
=> A(x) =

(1+C(x)) = "

&

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

44

Masreshaw Walle Abate

=> [xn ] A(x) = 4(-2) n -2(-1) n = (-1) n (4 2 n -2) =(-1) n ( 2 n+2-2)

=> an+1 = (-1)n ( 2 n+2 -2)
=> an = (-1)n -1 ( 2 n+1-2)..... (5)
Equating equation (5) and (3) we have
Dn = 2 n+1-2 =2(2n-1) = 2,6,14,30,62,126,....n 1
1

1
1

1
Example 2:
1
A=
1

1
1

.
.

1
1

0
1

0
0

0
0

0
0

0
0

0
0

1
0

1
1

0
1

0
0

0
0

0
0

0
0

0
0

0
0

1
0

1
1

0
.

0
.

0
.

0
.

0
.

0
.

. . .

. . .
. . .

. . .
. . .
.
. . .

. . .
. . .

. . .
. . .

(1)

1 1 0
1 1

(1) is a given matrix with upper left square matrix [1],

, 1 1 1,...

1
1

1 0 1

Now we want to evaluate the determinant of the upper left corner matrix as follows
1
.|1| = 1 = : , 3
1

1
1
3 = 2 = : , 41
1
1

1
1
0

1
0
1
14 = 3 = : , 5
1
1
1

1
1
0
0

0
1
1
0

0
05 = 5 = : ,
9
1
1

The nth such determinant is denoted by Dn. One way to determine one of these say, D5 is as follows. Consider the
system

1
0

0
0

0 0 0 0 a1 1

1 0 0 0 a 2 1
1 1 0 0 a3 = 1

0 1 1 0 a 4 1

0 0 1 1 a5 1

Where the right hand side is the first column from the original matrix of (1) for n=5
By Cramer's rule and the properties of determinants, we have

NASS Rating: 3.30 - Articles can be sent to [email protected]

(2)

45

Determinants by Using Generating Functions

1 0 0 0

1 1 0 0 1
0 1 1 0 1
0 0 1 1 1
0 0 0 1 1
= 8 = :6 In general by induction we have an = (-1) n-1 Dn (3)
6 =
1 0 0 0 0
1 1 0 0 0
0 1 1 0 0
0 0 1 1 0
0 0 0 1 1
Now let us introduce a generating function for the column of (1) and rewrite it as (2). Then we get the system

x
0
3
x
0

x5

.
.
.

x3

x3

x5

x5

x5

0
x

. . . a1 1

. . . a 2 x
. . . a 3 x 2

. . . a 4 x 3
. . . a5 = x 4
. . . a 6 x 5

. . . . .
. . . . .

. . . . .

(4)

Then the right hand side of (4) has a generating function

x + x2 - x3 + x4 - x5 +.... =

And, except the elements on the main diagonal of the first matrix of left side of (4),
The first column has a generating function C(x) = x+ x3 + x5 + x7 +... =
The 2nd column of has a generating function x C(x) = x2 + x4 + x6+...
The 3rd column has a generating function x2 C(x) =x3 +x5 +x7 + .
Letting A(x) = a1+ a2x+ a3 x2 +... as the generating function for the sequence a1, a2, a3... and summing on both
sides of (4) we get
A (x) + a1 (x+x3+x5+... ) + a2x (x+x3+x5+x7) + a3x2 (x+x3+x5+x7+) =

i.e. A (x) + a1

1
1+ x

1
x
1
1
+ a2 x
+ a3x2
+... =
2
2
2
1+ x
1 x
1 x
1 x

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

46

Masreshaw Walle Abate

1
1
=
2
1+ x
1 x

A (x) + A (x)
A (x) =
For n 1,

[x ]A(x) a = (-1)
n

= 1-2x+3x2- 5x3+8x4+...
n-1

Fn-1

(5)

Where Fn is the n th Fibonacci number.

Equating (5) and (3) we get

.: = < , = > 1
Note:'

( Given a generating function A(x) we use'

( A(x) to denote an, the coefficient of x n.()

Proposition
If we consider the following infinite matrix with 1s in the supper diagonal
u0

u1
u
2
u3

u
A= 4
u5

u6
u7

.
.

v1
v2

1
v1

0
1

0
0

0
0

0
0

v3

v2

v1

v4
v5

v3
v4

v2
v3

v1
v2

1
v1

0
1

v6

v5

v4

v3

v2

v1

v7

v6

v5

v4

v3

v2

.
.

.
.

.
.

.
.

.
.

.
.

Let U (x) =

u
n =0

. . .

. . .
. . .

. . .

. . .
.
. . .

. . .
. . .

. . .
. . .

(6)

and V (x) =

v
n =1

x n be the generating functions for the sequence

u0, u1, u2 .. And v1, v2... respectively

If A (x) =

U ( x)
n
= a n +1 x then an = (-1) n-1 Dn and 1+xA (-x) is the generation function of Dn.
1 + V ( x) n =0

Proof
As we have seen in the above examples consider the system

v1 x
v x2
2 3
v3 x
v x4
4
v5 x 5

.
.
.

0
x
c1 x 2
c2 x 3
c3 x 4
c4 x 5
.

0
0
x2
c1 x 3
c2 x 4
c3 x 5
.

0
0
0
x3
c1 x 4
c2 x 5
.

0
0
0
0
x4
c1 x 5
.

0
0
0
0
0
x5
.

.
.

.
.

.
.

.
.

.
.

. a1 u 0

. a 2 u1 x
. a3 u 2 x 2

. a 4 u 3 x 3
. a5 = u 4 x 4
. a 6 u 5 x 5

. . .
. . . . .

. . . . .
.
.
.
.
.
.
.

.
.
.
.
.
.
.

NASS Rating: 3.30 - Articles can be sent to [email protected]

(*)

47

Determinants by Using Generating Functions

Summing on both sides of (*) we get A(x) +a1 V(x) +a2 x V(x) + a3x2V(x) +... = U(x)

A (x) + A (x) V (x) = U (x)

A (x) (1+V(x)) = U (x) A(x) =

7@

Now from (6) we have D1 =u0, D2 =u0v1 u1

D2

u1 =u0v1 D1.and from (*) v1a1 +a2 =u1&a1 =u0 v1u0 +a2 = u0v1

a2 =-D2 similarly a3 =D3 and continuing inductively and if x = 1 in (*) for the nxn case we have by Cramers rule as

we have seen above an= (-1) n-1 Dn where Dn is the determinant of the nxn upper left corner sub matrix of (6).
i.e. D1 = a1, D2 = -a2, D3 = a3, D4 = -a4...
Let A(x) = a1+a2x + a3x2 + a4x3+...

A(-x) = a1-a2x +a3x2 a4x3 +...

xA (-x) = a1x-a2 x2+a3x3 a4x4+...
1+xA(-x) = 1+a1x-a2x2+a3x3-a4x4+a5x5+... =1+D1x+D2x2+D3x3+D4x4+
1+xA(-x) is the generating function for Dn, where a0=D0 = 1
1

1
1

Example: If
1
A=
1

1
1

.
.

2
0

1
2

0
1

0
0

0
0

0
0

0
2

2
0

0
2

2
0

1
2

0
1

0
2

2
0

0
2

2
0

0
2

2
0

Then
1
.|1| = 1 = : , 3
1
.Dn+1 = 2Dn+1

1
1
3 = 3 = : , 41
2
1

1
2
0

. . .

. . .
. . .

. . .

. . .
.
. . .

. . .
. . .

. . .
. . .

1
0
1
14 = 7 = : , 5
1
2
1

(1)

1
2
0
2

0
1
2
0

0
05 = 15 = : ,
9
1
2

Are the determinant of some nxn upper left corner sub matrices one way to determine say D5, is as follows.
Consider the system

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

48

Masreshaw Walle Abate

2
0

2
0

0 0 0 0 a1 1

1 0 0 0 a 2 1
2 1 0 0 a3 = 1

0 2 1 0 a 4 1

2 0 2 1 a5 1

(2)

Where the right hand side is the first column from the original matrix of (1) for n=5
By Cramers rule and if two columns are interchanged the determinant changes only sign. Then, we have

1 0 0 0

2 1 0 0 1
0 2 1 0 1
2 0 2 1 1
0 2 0 2 1
= 31 = :6 in general by induction we have an=(-1) n-1 Dn
6 =
1 0 0 0 0

(3)

2 1 0 0 0
0 2 1 0 0
2 0 2 1 0
0 2 0 2 1
Now let us introduce the generating functions for the columns of (1) and rewrite it as (2) we get the system

2x
0
3
2x
0

2x 5

.
.

0
x

0
0

0
0

0
0

0
0

2x 2
0
2x 4
0

x2
2x3
0
2x5

0
x3
2x 4
0

0
0
x4
2x5

0
0
0
x5

.
.
.

.
.
.

.
.
.

.
.
.

.
.
.

. . . a1 1

. . . a 2 x
. . . a 3 x 2

. . . a 4 x 3
. . . a5 = x 4
. . . a 6 x 5

. . . . .
. . . . .

. . . . .

Then the right hand side of (4) has a generating function U(x) = 1-x+x2-x3+... =

(4)

1
1+ x

And except the elements on the main diagonal of the first matrix of left of (4),
i.e excluding the1`s on the main diagonal of (4), the 1stcolumn has a generating function
V(x)=2x+2x3+2x5+... =

2x
1 x2

The 2nd column has a generating function xV(x)

NASS Rating: 3.30 - Articles can be sent to [email protected]

49

Determinants by Using Generating Functions

The 3rd column has a generating function x2V(x)

letting A (x) = a1+ a2x + a3x2+ as the generating function for the sequence a1, a2, a3 and summing on both
sides of (4) we get
A(x) + a1

2x
2x
2x
1
+ a2 x
+ a 3x 3
+... =
2
2
2
1+ x
1 x
1 x
1 x

1 x
1 x
1
=
=
2
2
1 + 2x x
1 + 2x x 1 + x
2

A (x) =

1
1+ x
7

A
BCA

U ( x)
1 + V ( x)

* here A(x)=a1+a2x+a3x2+a4x3+

A(-x)=a1-a2x+a3x2-a4x3+
xA(-x) = a1x-a2x2+a3x3-a4x4+
A(-x) =

1+ x
1 2x x 2

xA (-x) =

x + x2
1 2x x 2

1+xA(-x) =

1+xA(-x) =

1 x
1 2x x 2

1+x A(-x)=1+a1x-a2x2+a3x3-a4x4+.=
=1+D1x+D2x2+D3x3+D4x4+=

1 x
1 2x x 2

1 x
1 2x x 2

1 x
is the generating function for Dn where a0 =1=D0
1 2x x 2

Here U(X) =

1
2x
and V(x) =
in closed form.
1+ x
1 x2

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

50

Masreshaw Walle Abate

4
9

Example: If
16

25
A=
36

49
81

.
.

1 0

1 1

1 1

1 1

1 1
1 1

1
1

1
1

1
1

0
1

1 1

1 1

Then
1
.|1| = 1 = : , 3
4

1
1
3 = 3 = : , 44
1
9

Dn+1 = -Dn+2(-1)n+2

1
1
1

. . .

. . .
. . .

. . .

. . .
.
. . .

. . .
. . .

. . .
. . .

1
0
4
14 = 5 = : , 5
9
1
16

(1)

1
1
1
1

0
1
1
1

0
05 = 7 = : ,
9
1
1

Are the determinant of some nxn upper left corner sub matrices one way to determine say D5, is as follows.
Consider the system

1
1

1
1

0 0 0 0 a1 1

1 0 0 0 a 2 4
1 1 0 0 a 3 = 9

1 1 1 0 a 4 16

1 1 1 1 a5 25

(2)

Where the right hand side is the first column from the original matrix of (1) for n=5
By Cramers rule and if two columns are interchanged the determinant changes only sign. Then, we have

1 0 0 0

1 1 0 0
1 1 1 0

4
9

1 1 1 1 16
1 1 1 1 25
= 9 = :6 in general by induction we have an=(-1) n-1 Dn
6 =
1 0 0 0 0
1 1 0 0 0
1 1 1 0 0
1 1 1 1 0
1 1 1 1 1
Now let us introduce the generating functions for the columns of (1) and rewrite it as (2) we get the system

NASS Rating: 3.30 - Articles can be sent to [email protected]

(3)

51

Determinants by Using Generating Functions

x
x2
3
x
x4

x5

.
.

0
x
x2

0
0
x2

0
0
0

0
0
0

0
0
0

x3
x4
x5
.
.

x3
x4
x5
.
.

x3
x4
x5
.
.

0
x4
x5
.
.

0
0
x5
.
.

. . . a1 1

. . . a 2 4 x
2
. . . a3 9 x

. . . a 4 16 x 3
. . . a5 = 25x 4
. . . a6 36 x 5

. . . . .
. . . . .

. . . . .

Then the right hand side of (4) has a generating function U(x) = 1+4x+9x2+16x3+... =

(4)

1+ x
(1 x ) 3

And except the elements on the main diagonal of the first matrix of left of (4),
i.e excluding the1`s on the main diagonal of the first matrix of left of (4), the 1stcolumn has a generating function
V(x)=x+x2+x3+... =

x
1 x

The 2nd column has a generating function xV(x) = x2+x3+...

The 3rd column has a generating function x2V(x)
letting A (x) = a1+ a2x + a3x2+ as the generating function for the sequence a1, a2, a3 and summing on both
sides of (4) we get
A(x) + a1

1+ x
x
x
x
+ a2 x
+ a 3x 3
+... =
1 x
1 x
1 x
(1 x ) 3

[1 +

1+ x
x
=
1 x (1 x ) 3

1+ x
x
]=
1 x (1 x ) 3

[1 + V x ]=U(x)
=

7@

*here A(x) =a1+a2x+a3x2+a4x3+ =

A (-x) =a1-a2x+a3x2-a4x3+ =

1+ x
1+ x
=
2
(1 x ) 1 2 x + x 2

1 x
1 + 2x + x 2

xA(-x) = a1x-a2x2+a3x3-a4x4+=x(

x x2
1 x
)
=
1 + 2x + x 2 1 + 2x + x 2

Impact Factor(JCC): 2.7341 - This article can be downloaded from www.impactjournals.us

52

Masreshaw Walle Abate

1+x A(-x)=1+a1x-a2x2+a3x3-a4x4+.=

=1+D1x+D2x2+D3x3+D4x4+=

1 + 2x + x 2 + x x 2
(1 + x) 2

1 + 2 x + x 2 + x x 2 1 + 3x
=
(1 + x) 2
(1 + x) 2

1+x A(-x)=1+a1x-a2x2+a3x3-a4x4+.=

1 + 3x
is the generating function for
(1 + x) 2

Dn where a0 =1=D0
Here U(X) =

1+ x
x
and V(x) =
in closed form.
3
1 x
(1 x )

1 + 3x
1
3x
=
+
= 1+
2
2
2
(1 + x) (1 + x) (1 + x)
=1+

: = 1

2= 1

3=

= 1

2= 1 = 1 And D0 =1

Conflict of Interest
The authors declare that there is no conflict of interests regarding the publication of this paper.

ACKNOWLEDGEMENTS
The authors would like to thank my best friend Mr. Fasika Wondimu who motivated me to do this research.

REFERENCES
1.

SEYOUM GETU, Evaluating Determinants via Generating functions, Howarg University Washington, Dc20059,
Reprinted from the Mathimatics magazine Vol.64.No.1.February 1991.

2.

Daniel L.A CoHen, Basic Techniques of combinatorial Theory.

3.

David C.Lay, Linear Algebra and its Applications, 3 rd edition.

4.

Purna Chandra Biswal (Ass.prof of mathematics National institute of science and Technology palur Hills,
Berhampur ), Discrete Mathematics and Graph theory, prentic Hall of India private limited, NewDelhi, 2005

5.

Nch in lyengar, Discrete mathematics, Vikas publishing house pvt LTD, 2004

6.

Amdeberhan Ayeligne, Seminal Report on Application of Generating functions, AAU 2007

7.

Discrete Mathematics and Its Applications, Seventh Edition, Kenneth H. Rosen Monmouth University
(and formerly AT&T Laboratories page 537

NASS Rating: 3.30 - Articles can be sent to [email protected]