• Publications
  • Influence
The cyclic groups via the Pascal matrices and the generalized Pascal matrices
Abstract In this paper, given a positive integer m , we consider the multiplicative order of upper and lower triangular matrices and symmetric matrices derived from Pascal’s triangle when read moduloExpand
  • 24
  • 2
On Fibonacci search method with k-Lucas numbers
TLDR
In this paper, using k-Lucas numbers instead of conventional Fibonacci numbers and conventional Lucas numbers, we have made more improvements on location of the intervals containing optimal point in the classical fibonacci search algorithm. Expand
  • 16
  • 1
Numerical method to solve chemical differential‐algebraic equations
In this article, the solution of a chemical differential-algebraic equation model of general type F(y, y′, x) = 0 has been done using MAPLE computer algebra systems. The MAPLE program is given in theExpand
  • 38
An application of Fibonacci numbers in matrices
TLDR
In this paper, we investigate the determinants of the matrices obtained by k sequences of the generalized order-k Fibonacci numbers. Expand
  • 31
Numerical solutions of chemical differential-algebraic equations
TLDR
In this paper, the solution for a chemical differential algebraic equation (DAE) can be expanded up to arbitrary order using MAPLE computer algebra systems. Expand
  • 16
On determinants of matrices with general Fibonacci numbers entries
  • Erdal Karaduman
  • Mathematics, Computer Science
  • Appl. Math. Comput.
  • 1 August 2005
TLDR
In this paper, we investigate the properties of the determinants of matrices obtained by generalized order-k (k-step) Fibonacci numbers. Expand
  • 11
On the k-Nacci Sequences in Finite Binary Polyhedral Groups
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 theExpand
  • 10
K-nacci Sequences in Finite Triangle Groups
A k -nacci sequence in a finite group is a sequence of group elements x 0 , x 1 , x 2 , … , x n , … for which, given an initial (seed) set x 0 , x 1 , x 2 , … , x j − 1 , each element is defined byExpand
  • 5
  • PDF
On the period of Fibonacci sequences in nilpotent groups
TLDR
We show that the period of 2-step general Fibonacci sequences in finite cyclic groups is pk(p) for certain prime numbers. Expand
  • 10
General 2-step Fibonacci sequences in nilpotent groups of exponent p and nilpotency class 4
TLDR
We give formulas to obtain 2-step general Fibonacci sequences constructed by two generating elements of the nilpotent groups of exponent p and nilpotency class 4. Expand
  • 11
...
1
2
3
4
...