On the k-Nacci Sequences in Finite Binary Polyhedral Groups

@article{Deveci2011OnTK,
  title={On the k-Nacci Sequences in Finite Binary Polyhedral Groups},
  author={{\"O}m{\"u}r Deveci and Erdal Karaduman and Colin M. Campbell},
  journal={Algebra Colloquium},
  year={2011},
  volume={18},
  pages={945-954}
}
A k-nacci sequence in a finite group is a sequence of group elements x0,x1,…,xn,… for which, given an initial (seed) set x0,x1,…,xj-1, each element is defined by It is important to note that the Fibonacci length depends on the chosen generating n-tuple for a group. The binary polyhedral groups have been studied recently by C.M. Campbell and P.P. Campbell for their Fibonacci lengths. In this paper, we obtain the period of k-nacci sequences in the binary polyhedral groups 〈2,2,2〉, 〈n,2,2〉, 〈2,n,2… 
The k-Nacci Sequences in Some Special Modular Groups
A k-nacci (k-step Fibonacci) sequence in a finite group is a sequence of group elements x0, x1, x2, …, xn, … for which, given an initial (seed) set x0, x1, x2, …, xj-1, each element is defined by
The Generalized Order-k Lucas Sequences in Finite Groups
TLDR
The lengths of the periods of the 𝑖th generalized order-𝑘 Lucas orbits of the binary polyhedral groups ⟨𝑛,2,2⟩,⟨2,�l,2 ⟩ and the poly cathedral groups, including the polyhedralgroups, are obtained.
On the Basic k-nacci Sequences in Finite Groups
We define the basic k-nacci sequences and the basic periods of these sequences in finite groups, then we obtain the basic periods of the basic k-nacci sequences and the periods of the k-nacci
On Period of Generalized Fibonacci Sequence Over Finite Ring and Tridiagonal Matrix
In this study, F n  Fibonacci sequence was defined over an arbitrary ring and its some properties are investigated. The terms of this sequence are derivated by Tridiagonal determinant of the matrix.
The complex-type k-Fibonacci sequences and their applications
Abstract In this article, we define the complex-type k-Fibonacci numbers and then give the relationships between the k-step Fibonacci numbers and the complex-type k-Fibonacci numbers. Also, we obtain
The k-nacci sequences in Q2n × φℤ2m
The periods of the k-step Fibonacci and k-step Pell sequences in D 2 n × Z 2 i and D 2 n × φ Z
The direct product D2n × Z2i and the semidirect product D2n ×φ Z2i for n, i ≥ 3 are defined by the presentations D2n × Z2i = 〈 x, y, z : x = y = (xy) = z i = [x, z] = [y, z] = e 〉
Some properties of k-generalized Fibonacci numbers
Fn (k) = (Fm) (Fm+1) r , n = mk + r. In [14], Özkan et al. defined a new family of k-Lucas numbers and gave some identities of the new family of k-Fibonacci and k-Lucas numbers. Özkan et al. [15]
A new family of k- Gaussian Fibonacci numbers
In this manuscript, a new family of k- Gaussian Fibonacci numbers has been identified and some relationships between this family and known Gaussian Fibonacci numbers have been found. Also, I the
Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials
Abstract In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are
...
...

References

SHOWING 1-5 OF 5 REFERENCES
Fibonacci Length of Generating Pairs in Groups
Let G be a group and let x, y ∈ G. If every element of G can be written as a word $${x^{{\alpha _1}}}{y^{{\alpha _2}}}{x^{{\alpha _3}}} \ldots {x^{{\alpha _{n - 1}}}}{y^{{\alpha _n}}}$$ (1)
Fibonacci lengths involving the wall number k(n)
Two infinite classes of special finite groups considered (The groupG is special, ifG’ andZ(G) coincide). Using certain sequences of numbers we give explicit formulas for the Fibonacci lenghts of