#### Abstract

We apply the binomial transforms to Padovan and Perrin matrix sequences. Also, the Binet formulas, summations, and generating functions of these transforms are found by recurrence relations. Finally, we illustrate the relations between these transforms by deriving new formulas.

#### 1. Introduction and Preliminaries

There are so many studies in the literature that are concernes about the special number sequences such as Fibonacci, Lucas, Pell, Jacobsthal, Padovan, and Perrin (see, e.g., [1–4] and the references cited therein). In Fibonacci numbers, there clearly exists the term golden ratio which is defined as the ratio of two consecutive of Fibonacci numbers that converges to . It is also clear that the ratio has so many applications in, specially, physics, engineering, architecture, and so forth [5, 6]. In a similar manner, the ratio of two consecutive Padovan and Perrin numbers converges to
that is named as *plastic constant *and was firstly defined in 1924 by Gérard Cordonnier. He described applications to architecture and illustrated the use of the plastic constant in many buildings.

Although the study of Perrin numbers started in the beginning of the 19th. century under different names, the master study was published in 2006 by Shannon et al. in [3]. The authors defined the Perrin and Padovan sequences as in the forms respectively.

On the other hand, the matrix sequences have taken so much interest for different types of numbers (cf. [7–9]). For instance, in [7], authors defined new matrix generalizations for Fibonacci and Lucas numbers, and by using basic matrix approach they showed some properties of these matrix sequences. In [9], authors defined a new sequence which generalizes -Fibonacci and -Lucas sequences at the same time. After that, by using it, they established generalized -matrix sequence. Finally, they presented some important relationships among this new generalization, -Fibonacci and -Lucas sequences and their matrix sequences. In [8], Gulec and Taskara gave new generalizations for -Pell and -Pell Lucas sequences for Pell and Pell-Lucas numbers. Considering these sequences, they defined the matrix sequences which have elements of -Pell and -Pell Lucas sequences. Also, they investigated their properties. Moreover, in [10], authors develop the matrix sequences that represent Padovan and Perrin numbers and examined their properties.

In addition, some matrix based transforms can be introduced for a given sequence. Binomial transform is one of these transforms, and there are also other ones such as rising and falling binomial transforms (see [11–13]).

Motivated by [10, 12], the goal of this paper is to apply the binomial transforms to the Padovan and Perrin matrix sequences . Also, the generating functions of these transforms are found by recurrence relations. Finally, the relations between these transforms are illustrated by deriving new formulas.

Now, we give some preliminaries related to our study. Given an integer sequence , the binomial transform of the sequence , , is given by

In [10], for ,, authors defined Padovan and Perrin matrix sequences as in the form where where

Proposition 1 (see [10]). *Let one considers , the following properties are held:*(i) (ii)*for **, the following statements are satisfied:*(iii)*for *,
(a),
(b),
(c),* where* * or *, (d),* for* .

#### 2. Binomial Transform of Padovan and Perrin Matrix Sequences

In this section, we will mainly focus on binomial transforms of Padovan and Perrin matrix sequences to get some important results. In fact, as a middle step, we will also present the recurrence relations, Binet formulas, summations, and generating functions.

*Definition 2. *Let and be the Padovan and Perrin matrix sequences, respectively. The binomial transforms of these matrix sequences can be expressed as follows:(i) the binomial transform of the Padovan matrix sequence is ,(ii) the binomial transform of the Perrin matrix sequence is .

We note that, from Definition 2 and (4) and (5), for , we obtain

The following lemma will be the key of the proof of the next theorems.

Lemma 3. *For , the following equalities are held:*(i)*,*(ii)*. *

*Proof. *Firstly, in here we will just prove (i), since (ii) can be thought in the same manner with (i).

(i) By using Definition 2 and the well known binomial equality
we obtain
which is a desired result.

From the previous lemma, note that(i) also can be written as ,(ii) also can be written as .

Theorem 4. *For ,*(i)* recurrence relation of sequences is
with initial conditions
*(ii)* recurrence relation of sequences is
with initial conditions
*

*Proof. *Similarly for the proof of the previous theorem, only the first case (i) will be proved. We will omit the other cases since the proofs will not be different.

(i) By considering the right-hand side of equality in (i) and Definition 2, we obtain

By taking, account equality , we get

From Lemma 3 and properties of binomial sum, we have

On the other hand, by using (4) and the equality , we get
which has completed the proof of this case.

The characteristic equation of sequences and in (13) and (15) is . Let , and be the roots of this equation. Then, Binet's formulas of sequences and can be expressed as where Now, we give the sums of binomial transforms for Padovan and Perrin matrix sequences.

Theorem 5. *Sums of sequences and are*(i)(ii)*. *

*Proof. *(i) By considering (9), we have

Now, if we take , and in first equality of Proposition 1-(ii), then we obtain

Afterwards, by taking into account (4), we conclude

(ii) The proof of the binomial transform of Perrin matrix sequences can be seen by taking into account (10), Proposition 1-(ii) and (5), similarly to the proof of (i).

Theorem 6. *The generating functions of the binomial transforms for and are*(i) *(ii) **respectively.*

*Proof. *We omit Padovan case since the proof will be quite similar.

Assume that is the generating function of the binomial transform for . Then, we have
From Theorem 4, we obtain
Now, the rearrangement of the equation implies that
which is equal to the in theorem.

Hence, the result is obtained.

#### 3. The Relationships between New Binomial Transforms

In this section, we present the relationship between these binomial transforms.

Theorem 7. *For , one has*(i)*, where ,*(ii)*,
*(iii)*, where or ,*(iv)*, where .*

*Proof. *(i) From Definition 2, we have

By considering Proposition 1-(iii), we obtain

By taking into account Vandermonde’s identity , we get

(ii) Here, we will just show that the truthness of the equality , since the other can be done similarly. By considering (9), (10), and Proposition 1-(iii), we obtain

(iii) By considering (10) and Proposition 1-(iii), we obtain

From (5), we have

Now, by taking into account again (10), we get , as required.

The final part of the proof can be seen similarly as in the proof of (iii).

Theorem 8. *The properties of the transforms and would be illustrated by following way:*(i)*,
*(ii)*,
*(iii)*. *

*Proof. *We will omit the proof of (ii) and (iii), since it is quite similar to (i). Therefore, by considering Definition 2 and Lemma 3-(i), we have
From Proposition 1-(iii), we get

Theorem 9. *For , the relation between the transforms and is
*

*Proof. *By considering Definition 2, we have
From Proposition 1-(iii), we get

By choosing in Theorem 9 and using the initial conditions of (4) and (5), we obtain the following corollary.

Corollary 10. *The following equalities are held:*(i)*,
*(ii)*. *

#### Conflict of Interests

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