On the Periods of 2-Step General Fibonacci Sequences in the Generalized Quaternion Groups

We study 2-step general Fibonacci sequences in the generalized quaternion groups . In cases where the sequences are proved to be simply periodic, we obtain the periods of 2-step general Fibonacci sequences.


Introduction
The study of the Fibonacci sequences in groups began with the earlier work of Wall 1 in 1960, where the ordinary Fibonacci sequences in cyclic groups were investigated.In the mideighties, Wilcox 2 extended the problem to the abelian groups.In 1990, Campbell et al. 3 expanded the theory to some classes of finite groups.In 1992, Knox proved that the periods of k-nacci k-step Fibonacci sequences in the dihedral groups are equal to 2k 2, in 4 .In the progress of this study, the article 5 of Aydin and Smith proves that the lengths of the ordinary 2-step Fibonacci sequences are equal to the lengths of the ordinary 2-step Fibonacci recurrences in finite nilpotent groups of nilpotency class 4 and a prime exponent, in 1994.
Since 1994, the theory has been generalized and many authors had nice contributions in computations of recurrence sequences in groups and we may give here a brief of these attempts.In 6, 7 the definition of the Fibonacci sequence has been generalized to the ordinary 3-step Fibonacci sequences in finite nilpotent groups.Then in 8 it is proved that the period of 2-step general Fibonacci sequence is equal to the length of the fundamental period of the 2-step general recurrence constructed by two generating elements of a group of nilpotency class 2 and exponent p.In 9 Karaduman and Yavuz showed that the periods of the 2-step Fibonacci recurrences in finite nilpotent groups of nilpotency class 5 and a prime exponent are p•k p , for 2 < p ≤ 2927, where p is a prime and k p is the period of the ordinary 2-step Fibonacci sequence.The main role of 10, 11 in generalizing the theory was to study the 2-step general Fibonacci sequences in finite nilpotent groups of nilpotency class 4 and exponent p and to the 2-step Fibonacci sequences in finite nilpotent groups of nilpotency class n and exponent p, respectively.
One may consult 12, 13 to see the results of the Fibonacci sequences in the modular groups concerning the periodicity of 2-step Fibonacci sequences constructed by two generating elements.
Going on a detailed literature in this area of research, we have to mention certain essential computation on the Fibonacci lengths of new structures like the semidirect products, the direct products, and the automorphism groups of finite groups which have been studied in 14-19 .Finally, we refer to 20 where Karaduman and Aydin studied the periodicity property of 2-step general Fibonacci sequences in dihedral groups and the goal of this paper is to calculate the periods of 2-step general Fibonacci sequences in the generalized quaternion groups.
Let G a 0 , a 1 , a 2 , . . ., a j−1 be a finite group.A k-nacci sequence in group G is a sequence {x n } ∞ n 0 of group elements for which each element is defined by This sequence of the group G is denoted by F k G; a 0 , a 1 , a 2 , . . ., a j−1 .We also call a 2-nacci sequence of group elements a Fibonacci sequence of a finite group.A finite group G is knacci sequenceable if there exists a k-nacci sequence of G such that every element of the group appears in the sequence.A sequence of group elements is periodic if after a certain point, it consists only of repetitions of a fixed subsequence.The number of elements in the repeating subsequence is called the period of the sequence.For example, the sequence a, b, c, d, d, e, b, c, d, e, . . . is periodic after the initial element a and has period 4. We denote the period of a k-nacci sequence F k G; a 0 , a 1 , a 2 , . . ., a j−1 by P k G; a 0 , a 1 , a 2 , . . ., a j−1 .A sequence of group elements is called simply periodic with period k if the first k elements in the sequence form a repeating subsequence.For example, the sequence a, b, c, d, e, f, a, b, c, d, e, f, . . . is simply periodic with period 6.The following theorem is well known.
Theorem 1.1 see 4 .Every k-nacci sequence in a finite group is simply periodic.

Main Theorems
The generalized quaternion group Q 4n , n ≥ 2 is a group with a presentation of the form It is easy to see that Q 4n is of order 4n, a has order 2n, b has order 4, and the relation a k b ba −k holds for all k ∈ Z.
First we consider the following lemma which will be used frequently without further reference.
Lemma 2.1.For an integer r, where 1 ≤ r < 2n, and for s ∈ {1, 3}, the following relations hold in Q 4n : i a r b s t b st , where t is any even integer; ii a r b s t a r b st , where t is any odd integer.
Proof.We may use an induction method on t for both parts, simultaneously.
Proof.Obviously, the order of ab is 4. If k 2, then x 4 a n 2 b, x 5 ab, x 6 a, x 7 b, . . .,

2.2
and hence the sequence has period 6.If k 3, then and so the period is 8. Now let k ≥ 4.Then, the first k 1 elements of Since ab is of order 4, this sequence reduces to Thus, x i a −1 a 2 b 3 ab 1.

2.6
It follows that x k j 1 for j 4 ≤ j ≤ k 1 .We also have x i ab a b.

2.7
It shows that Let G a, b be a finite nonabelian 2-generated group.A 2-step general Fibonacci sequence in the group G is defined by x 0 a, x 1 b, x i x m i−2 x l i−1 , for i ≥ 2, and the integers m and l.Now we study this sequence for group Q 4n .
Proof.First we consider the case m ≡ 0 mod 2n .Then the sequence is Obviously, the cycle does not begin again with a and b, and hence the sequence is not simply periodic.Now let m ≡ 0 mod 4 .Four cases occur.

2.9
Since the cycle does not begin again with a and b, the sequence is not simply periodic.
Case 2 l ≡ 1 mod 4 .Then Clearly, the sequence is not simply periodic.

2.11
Similar to Case 1, the sequence is not simply periodic.

2.12
Thus the sequence is not simply periodic.
Theorem 2.4.Let n be an even integer.
i If m ≡ 1 (mod 2n) and l ≡ 0 (mod 2n), then 2-step general Fibonacci sequence in Q 4n is simply periodic with period 2.
Proof.i Since n is even, m ≡ 1 mod 4 and l ≡ 0 mod 4 .Thus and the period is 2.
ii Since n is even, m ≡ 3 mod 4 and l ≡ 3 mod 4 .Note that m and l are odd integers.So the sequence reduces to 14 and the period is 3.
iii Because n is even, m ≡ 1 mod 4 and l ≡ 1 mod 4 .Furthermore, m and l are odd integers.Then the sequence reduces to x 4 a 2 b 3 , x 5 ab, x 6 a, x 7 b, . . .,

2.15
and the period is 6.
Theorem 2.5.Let n be an odd integer.
Proof.i By induction on k ≥ 0, we can show that x 2k a and x 2k 1 a −kl b.In particular, the period must be even.Now we have and so the period is 2n.
ii By induction on k ≥ 0, it may be shown that Therefore, the period must be even.Now we have and thus the period is 4n.
i If m ≡ 1 (mod 4), then 2-step general Fibonacci sequence in Q 4n is simply periodic with period 6n.
Proof.i Two cases occur.
Case 1 l ≡ 1 mod 4 .By induction on k ≥ 0, we can prove that the following relations hold:

2.19
Consequently, the period must be a multiple of 6.Now we have and hence the period is 6n.

2.22
Particularly, the period must be a multiple of 3. Since n 2k 1 l 1 is odd, then it is not a multiple of 2n.Thus x 6k 4 / b.Further, and hence the period is 6n.
iii By induction on k ≥ 0, we can prove the following relations: x 3k 1 a −k l 1 b, x 3k 2 a − n 1 k l 1 b.

2.24
Therefore, the period must be a multiple of 3. Now we have and so the period is 3n.