• Views 1,557
• Citations 11
• ePub 36
• PDF 468
`Abstract and Applied AnalysisVolume 2014, Article ID 273680, 12 pageshttp://dx.doi.org/10.1155/2014/273680`
Research Article

## Exact Determinants of Some Special Circulant Matrices Involving Four Kinds of Famous Numbers

Department of Information and Telecommunications Engineering, University of Suwon, Wau-ri, Bongdam-eup, Hwaseong-si, Gyeonggi-do 445-743, Republic of Korea

Received 12 April 2014; Accepted 2 May 2014; Published 20 May 2014

Copyright © 2014 Xiaoyu Jiang and Kicheon Hong. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

Circulant matrix family is used for modeling many problems arising in solving various differential equations. The RSFPLR circulant matrices and RSLPFL circulant matrices are two special circulant matrices. The techniques used herein are based on the inverse factorization of polynomial. The exact determinants of these matrices involving Perrin, Padovan, Tribonacci, and the generalized Lucas number are given, respectively.

#### 1. Introduction

Circulant matrix family is used for modeling many problems arising in solving various differential equations. Therefore, studying algorithms and various properties of new classes of problems to such patterned matrices is crucial for applications. It is important to develop new theories and methods and to modify and refine the well-known techniques, for solving differential equations.

Lei and Sun [1] proposed the preconditioned CGNR (PCGNR) method with a circulant preconditioner to solve such Toeplitz-like systems. Pang et al. [2] used the normalized preconditioned conjugate gradient method with Strang’s circulant preconditioner to solve a nonsymmetric Toeplitz system . By using a Strang-type block-circulant preconditioner, Zhang et al. [3] speeded up the convergent rate of boundary-value methods. Delgado et al. [4] developed some techniques to obtain global hyperbolicity for a certain class of endomorphisms of with ; this kind of endomorphisms is obtained from vectorial difference equations where the mapping defining these equations satisfies a circulant matrix condition. The Strang-type preconditioner was also used to solve linear systems from differential-algebraic equations and delay differential equations; see [58]. In [9], a semicirculant preconditioner applied to a problem, subject to Dirichlet boundary conditions at the inflow boundaries, was examined. A method was described for obtaining finite difference approximation solutions of multidimensional partial differential equations satisfying boundary conditions specified on irregularly shaped boundaries by using circulant matrices and fast Fourier transform (FFT) convolutions in [10]. Brockett and Willems [11] showed how the important problems of linear system theory can be solved concisely for a particular class of linear systems, namely, block-circulant systems, by exploiting the algebraic structure.

Circulant matrices have important applications in various disciplines including image processing, communications, and signal processing. The circulant matrices, a long fruitful subject of research, have in recent years been extended in many directions [12, 13]. The -circulant matrices are another natural extension of this well-studied class and can be found in [1424]. The -circulant matrix has a wide application, especially on the generalized cyclic codes [14]. The properties and structures of the -circulant matrices, which are called RSFPLR circulant matrices, are better than those of the general -circulant matrices, so there are good algorithms for determinants.

There are many interests in properties and generalization of some special matrices with famous numbers. Jaiswal evaluated some determinants of circulant whose elements are the generalized Fibonacci numbers [25]. Lin gave the determinant of the Fibonacci-Lucas quasi-cyclic matrices [26]. Lind presented the determinants of circulant and skew-circulant involving Fibonacci numbers in [27]. Shen et al. [28] discussed the determinant of circulant matrix involving Fibonacci and Lucas numbers. Akbulak and Bozkurt [29] gave the norms of Toeplitz involving Fibonacci and Lucas numbers. The authors [30, 31] discussed some properties of Fibonacci and Lucas matrices. Stanimirović gave generalized Fibonacci and Lucas matrix in [32]. Z. Zhang and Y. Zhang [33] investigated the Lucas matrix and some combinatorial identities.

The determinant problems of the RSFPLR circulant matrices and RSLPFL circulant matrices involving the Perrin, Padovan, Tribonacci, and the generalized Lucas number are considered in this paper. The explicit determinants are presented by using some terms of these numbers. The techniques used herein are based on the inverse factorization of polynomial. Firstly, we introduce the definitions of the RSFPLR circulant matrices and RSLPFL circulant matrices and properties of the related famous numbers. Then, we present the main results and the detailed process.

Definition 1. A row skew first-plus-last right (RSFPLR) circulant matrix with the first row , denoted by , is a square matrix of the form

The matrix with an arbitrary first row and the following rule for obtaining any other row from the previous one can be seen. Get the + 1st row by adding the last element of the th row to the first element of the th row and times the last element of the th row and then shifting the elements of the th row (cyclically) one position to the right.

Note that the RSFPLR circulant matrix is a circulant matrix [14] and that is neither the extension of skew circulant matrix [12, 13] nor its special case and they are two different kinds of special matrices. Moreover, it is a FLS -circulant matrix [1517] with .

We define as the basic RSFPLR circulant matrix; that is,

It is easily verified that has no repeated roots in its splitting field and is both the minimal polynomial and the characteristic polynomial of the matrix . In addition, is nonderogatory and satisfies and . Then a matrix can be written in the form if and only if is a RSFPLR circulant matrix, where the polynomial is called the representer of the RSFPLR circulant matrix .

It is clear that is a RSFPLR circulant matrix if and only if commutes with the ; that is,

Definition 2. A row skew last-plus-first left (RSLPFL) circulant matrix with the first row , denoted by , is a square matrix of the form

The matrix with an arbitrary first row and the following rule for obtaining any other row from the previous onecan be seen. Get the + 1st row by adding the first element of the th row to the last element of the th row and times the first element of the th row and then shifting the elements of the th row (cyclically) one position to the left.

Let and . By explicit computation, we find where is the backward identity matrix of the form

The Perrin [34, 35] and Padovan [34, 36] numbers and are defined by a third-order recurrence with the initial conditions , , , and , , and .

The Tribonacci [36, 37] and the generalized Lucas numbers and [37] are defined by a third-order recurrence with the initial conditions , , and , , and .

Recurrences (8) and (9) involve the characteristic equation , the roots of which are denoted by , , and . Then Moreover, the Binet form for the Perrin [34, 35] number is and the Binet form for Padovan [34, 36] number is where Recurrences (10) as well imply the characteristic equation , and their roots are denoted by , , and . Then Furthermore, the Binet form for the Tribonacci [36, 37] number is where is the th root of the polynomial , and the Binet form for the generalized Lucas [37] number is

If the first row of a RSFPLR circulant matrix is , , then the matrix is called Perrin, Padovan, Tribonacci, and generalized Lucas RSFPLR circulant matrix, respectively.

If the first row of a RSLPFL circulant matrix is , , , , then the matrix is called Perrin, Padovan, Tribonacci, and generalized Lucas RSLPFL circulant matrix, respectively.

#### 2. Main Results

By Theorem 1.1 in [15], we deduce the following lemma.

Lemma 3. Let . Then the eigenvalues of are given by and the determinant of is given by where    are the roots of the equation .

Lemma 4. Suppose that are the roots of the equation . If , then where , , and If , then where and , , and are the roots of the equation .

Proof. Since are the roots of the characteristic polynomial of , can be factored as
If , please see [22] for details of the proof.
If , then
Let . We obtain from . Taking the relation of roots and coefficients into account, we deduce that where and , , are the roots of the equation .

##### 2.1. Determinants of the RSFPLR Circulant Matrices and RSLPFL Circulant Matrices Involving Perrin Numbers

Theorem 5. Let be a Perrin RSFPLR circulant matrix. Then where , , and are the roots of the equation + + , and , , are the roots of the equation .

Proof. Obviously, has the form By Lemma 3, the Binet form (12), and (11), we have
By Lemma 4 and the recurrence (8), we obtain where and , , are the roots of the equation + + + and where and , , are the roots of the equation . Consequently, where

Theorem 6. Let be a Perrin RSFPLR circulant matrix. Then where

Proof. The matrix has the form According to Lemma 3, the Binet form (12), and (11), we have Using Lemma 4 and the recurrence (8), we obtain where Therefore,

Theorem 7. Let be a Perrin RSLPFL circulant matrix. Then where

Proof. Since the result can be derived from Theorem 6 and (6).

##### 2.2. Determinants of the RSFPLR Circulant Matrices and RSLPFL Circulant Matrices Involving Padovan Numbers

Theorem 8. Let be a Padovan RSFPLR circulant matrix. Then where , , are the roots of the equation + + + and , , are the roots of the equation .

Proof. The matrix has the form from Lemma 3, the Binet form (13), and (11).
Using Lemma 4 and the recurrence (9), we obtain where , , , are the roots of the equation . According to (32), we have the following results: where

Theorem 9. Let be a Padovan RSFPLR circulant matrix. Then where and , , are the roots of the equation .

Proof. The matrix has the form According to Lemma 3, the Binet form (13), and (11), we have Using Lemma 4 and (13), we obtain where , , , are the roots of the equation . Employing (41), we have the following results: where and , , are the roots of the equation .

Theorem 10. Let be a Padovan RSLPFL circulant matrix. Then where and , , are the roots of the equation .

Proof. The theorem can be proved by using Theorem 9 and (6).

##### 2.3. Determinants of RSFPLR Circulant Matrices and RSLPFL Circulant Matrices Involving Tribonacci Numbers

Theorem 11. Let be a Tribonacci RSFPLR circulant matrix. Then where and , , are the roots of the equation + + and , , are the roots of the equation .

Proof. Obviously, has the form According to Lemma 3, the Binet form (16), and (15), we have From Lemma 4 it follows that where , , , are the roots of the equation + + and where , , , are the roots of the equation . Consequently, we have the following results: where

Theorem 12. Let be a Tribonacci RSFPLR circulant matrix. Then where and , , are the roots of the equation .

Proof. The matrix has the form
According to Lemma 3, the Binet form (16), and (15), we have Considering Lemma 4 and (17), we obtain where , , , are the roots of the equation + + + and Consequently, where and , , are the roots of the equation + + .

Theorem 13. Let be a Tribonacci RSLPFL circulant matrix. Then where and , , are the roots of the equation .

Proof. The theorem can be proved by using Theorem 12 and (6).

##### 2.4. Determinants of the RSFPLR Circulant Matrices and RSLPFL Circulant Matrices Involving Generalized Lucas Numbers

Theorem 14. Let be a generalized Lucas RSFPLR circulant matrix. Then where , , are the roots of the equation + + + + , and , , are the roots of the equation .

Proof. The matrix has the form According to Lemma 3, the Binet form (17), and (15), we have From Lemma 4 and (17), we obtain where , , , are the roots of the equation + + + + and where , , , are the roots of the equation . Hence, where , , are the roots of the equation + + + + , and , , are the roots of the equation .

Theorem 15. Let be a generalized Lucas RSFPLR circulant matrix. Then where , , , are the roots of the equation .

Proof. The matrix has the form