Open Math. 2016; 14: 1104–1113
Open Mathematics Open Access
Research Article
˙Inci Gültekin* and Ömür Deveci On the arrowhead-Fibonacci numbers
DOI 10.1515/math-2016-0100 Received August 17, 2016; accepted November 16, 2016.
Abstract: In this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of the k-step Fibonacci sequence and then we give some of their properties. Also, we study the arrowhead-Fibonacci sequence modulo m and we obtain the cyclic groups from the generating matrix of the arrowhead-Fibonacci numbers when read modulo m: Then we derive the relationships between the orders of the cyclic groups obtained and the periods of the arrowhead-Fibonacci sequence modulo m.
Keywords: The arrowhead-Fibonacci Numbers, Sequence, Matrix, Period
MSC: 11K31, 11B50, 11C20, 15A15
1 Introduction
It is well-known that a square matrix is called an arrowhead matrix if it contain zeros all in entries except for the first row, first column, and main diagonal. In other words, an arrowhead matrix M mi;j is defined as D .n/ .n/ follows: 2 m1;1 m1;2 m1;3 m1;4 m1;n 3 6 m2;1 m2;2 0 0 0 7 6 7 6 m 0 m 0 0 7 6 3;1 3;3 7 6 : : 7 6 : :: : 7 . 6 : 0 0 : : 7 6 7 6 : : 7 4 mn 1;1 : : 0 mn 1;n 1 0 5 mn;1 0 0 0 mn;n ˚ k« The k-step Fibonacci sequence Fn is defined recursively by the equation
k k k k Fn k Fn k 1 Fn k 2 Fn C D C C C C C for n 0, where F k F k F k 0 and F k 1. 0 D 1 D D k 2 D k 1 D For detailed information about the k-step Fibonacci sequence, see [1, 2]. It is clear that the characteristic polynomial of the k-step Fibonacci sequence is as follows:
P F .x/ xk xk 1 x 1. k D Suppose that the .n k/th term of a sequence is defined recursively by a linear combination of the preceding k C terms:
an k c0an c1an 1 ck 1an k 1 C D C C C C C
*Corresponding Author: Inci˙ Gültekin: Department of Mathematics, Faculty of Science, Atatürk University, 25240 Erzurum, Turkey, E-mail: [email protected] Ömür Deveci: Department of Mathematics, Faculty of Science and Letters, Kafkas University 36100, Turkey, E-mail: [email protected]
© 2016 Gültekin and Deveci, published by De Gruyter Open. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License. On the arrowhead-Fibonacci numbers 1105
where c0; c1; : : : ; ck 1 are real constants. In [1], Kalman derived a number of closed-form formulas for the generalized sequence by the companion matrix method as follows: Let the matrix A be defined by 2 0 1 0 0 0 3 6 0 0 1 0 0 7 6 7 6 : 7 6 0 0 0 :: 0 0 7 A a 6 7 , i;j k k 6 : : : : : 7 D D 6 : : : : : 7 6 : : : : : 7 6 7 4 0 0 0 0 1 5 c0 c1 c2 ck 2 ck 1 then 2 3 2 3 a0 an 6 a1 7 6 an 1 7 n 6 7 6 7 A 6 : 7 6 :C 7 6 : 7 D 6 : 7 4 : 5 4 : 5 ak 1 an k 1 C for n > 0. Many of the obtained numbers by using homogeneous linear recurrence relations and their miscellaneous properties have been studied by many authors; see, for example, [3–11]. Arrowhead-Fibonacci numbers for the 2-step Pell and Pell-Lucas sequences were illustrated in [12]. In Section 2, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix N , which is defined by the aid of the characteristic polynomial of the k-step Fibonacci sequence. Then we derive their miscellaneous properties such as the generating matrix, the combinatorial representation, the Binet formula, the permanental representations, the exponential representation and the sums. The study of recurrence sequences in groups began with the earlier work of Wall [13], where the ordinary Fibonacci sequence in cyclic groups were investigated. The concept extended to some special linear recurrence sequences by some authors; see, for example, [3, 14–16]. In [3, 15, 17], the authors obtained the cyclic groups via some special matrices. In Section 3, we study the arrowhead-Fibonacci sequence modulo m: Also in this section, we obtain the cyclic groups from the multiplicative orders of the generating matrix of the arrowhead-Fibonacci sequence such that the elements of the generating matrix when read modulo m. Then we obtain the rules for the orders of the obtained cyclic groups and we give the relationships between the orders of those cyclic groups and the periods of the arrowhead-Fibonacci sequence modulo m.
2 The arrowhead-Fibonacci numbers
We next define the arrowhead matrix N ni;j .k 1/ .k 1/ by using the characteristic polynomial of the k-step F D C C Fibonacci sequence Pk .x/ as follows: 2 1 1 1 1 1 3 6 1 1 0 0 0 7 6 7 6 1 0 1 0 0 7 6 7 6 : : : 7 . 6 : : :: :: :: : 7 6 : : : : : : 7 6 7 4 1 0 : : : 0 1 0 5 1 0 : : : 0 0 1 Now we consider a new .k 1/-step sequence which is defined by using the matrix N and is called the arrowhead- C Fibonacci sequence. The sequence is defined by integer constants ak 1 .1/ ak 1 .k/ 0 and C D D C D ak 1 .k 1/ 1 and the recurrence relation C C D ak 1 .n k 1/ ak 1 .n k/ ak 1 .n k 1/ ak 1 .n/ (1) C C C D C C C C C for n 1, where k 2. 1106 ˙I. Gültekin, Ö. Deveci
Example 2.1. Let k 3, then we have the sequence D a4 .n/ 0; 0; 0; 1; 1; 0; 2; 4; 3; 3; 12; 16; 4; 27; 59; : : : : f g D f g By (1), we can write a generating matrix for the arrowhead-Fibonacci numbers as follows: 2 1 1 1 1 1 3 6 1 0 0 0 0 7 6 7 6 0 1 0 0 0 7 6 7 Gk 1 6 : : : 7 . C D 6 : : : 7 6 : : : 7 6 7 4 0 0 1 0 0 5 0 0 0 1 0 .k 1/ .k 1/ C C The matrix Gk 1 is said to be a arrowhead-Fibonacci matrix. It is clear that C 2 3 2 3 ak 1 .k 1/ ak 1 .n k 1/ C C C C C 6 ak 1 .k/ 7 6 ak 1 .n k/ 7 n 6 7 6 7 .Gk 1/ 6 C: 7 6 C : C 7 (2) C 6 : 7 D 6 : 7 4 : 5 4 : 5 ak 1 .1/ ak 1 .n 1/ C C C for n 0. Again by an inductive argument, we may write 2 n k 1 n k 3 akC1C akC1 Cn k n Ck 1 6 akC1 akC1 7 6 n Ck 1 nCk 2 7 n 6 0 7 .Gk 1/ 6 akC1 G akC1 7 ; C D 6 C C 7 6 : : 7 4 : : 5 n 1 n akC1 ak 1 C C u 0 where n k, ak 1 .u/ is denoted by ak 1 and Gk 1 is a .k 1/ .k 1/ matrix as follows: C C C C 2 n k n k 1 n 1Á n k n k 1 n k 2Á n k n k 1Á 3 a C a C a C a C a C a C a C a C k 1 C k 1 C C k 1 k 1 C k 1 C k 1 k 1 C k 1 n Ck 1 Cn k 2 Cn Á n Ck 1 Cn k 2 Cn k 3Á n Ck 1 Cn k 2Á 6 a C a C a a C a C a C a C a C 7 6 k 1 C k 1 C C k 1 k 1 C k 1 C k 1 k 1 C k 1 7 6 nCk 2 nCk 3 nC1 Á nCk 2 nCk 3 nCk 4Á nCk 2 nCk 3Á 7 G0 6 akC1 akC1 ak 1 akC1 akC1 akC1 akC1 akC1 7 . k 1 6 C C C C C C 7 C D 6 C C: C C C: C C : C 7 6 : : : 7 4 : : : 5 n n 1 n k 1Á n n 1 n 2 Á n n 1 Á ak 1 ak 1 ak 1C ak 1 ak 1 ak 1 ak 1 ak 1 C C C C C C C C C C C C C C k 1 It is important to note that det Gk 1 . 1/ C and the Simpson identity for a recursive sequence can be obtained C D from the determinant of its generating matrix. From this point of view, we can easily derive the Simpson formulas of the arrowhead-Fibonacci sequences for every k 2.
Example 2.2. Since det G3 1 and D 2 n 3 n 2 n 1Á n 2 3 a C a C a C a C 3 3 C 3 3 n 6 n 2 n 1 nÁ n 1 7 .G3/ 6 a C a C a a C 7 D 6 3 3 C 3 3 7 4 n 1 n 1 n 1Á n 5 a C a C a a 3 3 C 3 3 for n 2, the Simpson formula of sequence a3 .n/ is f g 2 3 n 3 n2 n 2 n 1 n n 2Á n 1 n 1Á n 3 n 1 n 1 a C a 2a C a C a a C a a C a C a C a 1. 3 3 3 3 3 C 3 3 C 3 3 3 3 D
Let C .c1; c2; : : : ; cv/ be a v v companion matrix as follows: 2 3 c1 c2 cv 6 1 0 0 7 6 7 C .c1; c2; : : : ; cv/ 6 : : 7 . D 6 : :: : 7 4 : : : 5 0 1 0 On the arrowhead-Fibonacci numbers 1107
See [18, 19] for more information about the companion matrix.
.u/ u Theorem 2.3 (Chen and Louck [20]). The .i; j / entry ci;j .c1; c2; : : : ; cv/ in the matrix C .c1; c2; : : : ; cv/ is given by the following formula: ! .u/ X tj tj 1 tv t1 tv t1 tv ci;j .c1; c2; : : : ; cv/ C C C C C C c1 cv (3) D t1 t2 tv t1; : : : ; tv .t1;t2;:::;tv / C C C