You are on page 1of 2

INTERNATIONAL JOURNAL OF MATHEMATICS AND SCIENTIFIC COMPUTING (ISSN: 2231-5330), VOL. 2, NO.

2, 2012 9
Right Circulant Matrices with Fibonacci Sequence
A.C.F. Bueno
AbstractIn this paper, the right circulant matrix with Fi-
bonacci sequence was dened, and then the formula for its
Euclidean norm and eigenvalues were derived.
Index Termsright circualnt matrix with Fibonacci sequence,
Euclidean norm, eigenvalues
MSC 2010 Codes 05C50, 11B50
I. INTRODUCTION
T
HE Fibonacci sequence is one of the most famous
sequences. It has many applications and can also be
seen in nature. It is dened by the linear recurrence relation
F
n
= F
n1
+ F
n2
; n 2
with initial values F
0
= 0 and F
1
= 1.
The closed form is given by the formula
F
n
=

n
(1 )
n

5
where =
1+

5
2
, the golden ratio.
II. PRELIMINARIES
Denition 2.1: A matrix RCIRC
n
(c) M
nxn
(R) is
said to be a right circulant matrix if it is of the form
RCIRC
n
(c) =
_
_
_
_
_
_
_
_
_
c
0
c
1
c
2
... c
n2
c
n1
c
n1
c
0
c
1
... c
n3
c
n2
c
n2
c
n1
c
0
... c
n4
c
n3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
c
2
c
3
c
4
... c
0
c
1
c
1
c
2
c
3
... c
n1
c
0
_
_
_
_
_
_
_
_
_
The above matrix has the following structure
1) Each row is a right cyclic shift of the row above
it. Thus, RCIRC
n
(c) is determined by the rst row
(c
0
, c
1
, . . . , c
n1
).
2) c
ij
= c
kl
whenever j i = k l (mod n).
Aldous Cesar F. Bueno is an instructor in the Department of Mathematics
and Physics of the Central Luzon State University, Science City of Mu noz,
Nueva Ecija, Phillippines. (e-mail: aldouz cezar@yahoo.com).
Furthermore, its eigenvalues are just the Discrte Fourier Trans-
form of its rst row. That is,

m
=
n1

k=0
c
k

mk
(1)
where = e
2i
n
.
Denition 2.2: The rst row of RCIRC
n
(c) is called the
circulant vector.
Denition 2.3: The matrix given by
RCIRC
n
(

F) =
_
_
_
_
_
_
_
_
_
F
0
F
1
F
2
... F
n2
F
n1
F
n1
F
0
F
1
... F
n3
F
n2
F
n2
F
n1
F
0
... F
n4
F
n3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
F
2
F
3
F
4
... F
0
F
1
F
1
F
2
F
3
... F
n1
F
0
_
_
_
_
_
_
_
_
_
is called the circulant matrix with bonacci sequence.
Denition 2.4: The Euclidean norm of an nxn matrix A,
which will be denoted by ||A||
E
, is given by the formula
||A||
E
=

_
n

i,j=0
a
2
ij
Denition 2.5: The spectral norm of an nxn matrix A,
which will be denoted by ||A||
2
, is given by the formula
||A||
2
= max{|
m
|}
where m=0,1, ..., n-1 and
m
are the eigenvalues of A.
The following Fibonacci identities and theorem will be
used for solving the Euclidean norm and eigenvalues of
RCIRC
n
(

F)
1) F
k
=

k+1
(1)
k+1
21
2)

n1
k=0
F
2
k
= F
n1
F
n
3)

n1
k=0
F
k
= F
n1
1
Theorem 2.6: From [1], the eigenvalues of
RCIRC
n
(g) =
_
_
_
_
_
_
_
_
_
a ar ar
2
... ar
n2
ar
n1
ar
n1
a ar ... ar
n3
ar
n2
ar
n2
ar
n1
a ... ar
n4
ar
n3
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
ar
2
ar
3
ar
4
... a ar
ar ar
2
ar
3
... ar
n1
a
_
_
_
_
_
_
_
_
_
are
0
=
a(1r
n
)
1r
and
m
=
a(1r
n
)
1r
m
where m=1,2, ..., n-1.
INTERNATIONAL JOURNAL OF MATHEMATICS AND SCIENTIFIC COMPUTING (ISSN: 2231-5330), VOL. 2, NO. 2, 2012 10
III. MAIN RESULTS
Theorem 3.1:
||RCIRC
n
(

F)||
E
=
_
nF
n1
F
n
Proof:
||RCIRC
n
(

F)||
E
=

_
n
n1

k=0
F
2
k
=
_
nF
n1
F
n
via the identity (2).
Theorem 3.2: The eigenvalues of RCIRC
n
(

F) are the
following

0
= F
n
1

m
=
1
21
_

n+1
1
m

(1)(1)
n+1
1(1)
m
_
where m=1,2, ..., n-1.
Proof: For m=0,

0
=
n1

k=0
F
k
= F
n
1
via identity (3).
For m = 0

m
=
n1

k=0
F
k

mk
=
n1

k=0
_

k+1
(1 )
k+1
2 1
_

mk
=
1
2 1
_

n1

k=0

k
(1 )
n1

k=0
(1 )
k
_

mk
Using Theorem 2.5, the result will be

m
=
1
2 1
_

n+1
1
m

(1 ) (1 )
n+1
1 (1 )
m
_
IV. CONCLUSION
The formulae for the Euclidean norm and eigenvalues of a
right circulant matrix with Fibonacci sequence (RCIRC
n
(

F))
were established.
REFERENCES
[1] A.C.F. Bueno, Right Circulant Matrices with Geometric Progression,
International Journal of Applied Mathematical Research, Vol. 1, No. 4,
593 - 603
[2] H. Civciv and R. Turkmen, On the Norms of Circulant Matrices
with Lucas Numbers, International Journal of Information and Systems
Science, Vol. 4, No.1, 142-147
[3] www.mathworld.wolfram.com/FibonacciNumber.html

You might also like