Results 91 to 100 of about 228 (120)

Bi-periodic Fibonacci quaternions

open access: yes, 2019
Bu çalışmada gerekli temel tanımlar verildikten sonra, iki periyodik Fibonacci ve Lucas kuaterniyon dizileri tanıtılmıştır. Daha sonra iki periyodik Fibonacci ve Lucas kuaterniyon dizilerinin üreteç fonksiyonları ve genel terimini içeren formülleri elde ...
Uluyol, Sevgi
core  

The k-Fibonacci dual quaternions

open access: yesInternational Journal of Mathematical Analysis, 2018
openaire   +3 more sources

On Complex Fibonacci Quaternions

open access: yesAdvances in Applied Clifford Algebras, 2012
Let \(\{F_n\}\) be the Fibonacci sequence and \[ Q_n = F_n + F_{n+1}e_1 + F_{n+2}e_2 + F_{n+3}e_3 \] be the \(n\)-th Fibonacci quaternion, where \(e_1, e_2, e_3\) are the standard orthonormal basis in \(R^3\) and they satisfy equalities \[ e_1^2 = e_2^2 = e_3^2 = e_1e_2e_3 = -1.
Serpil Halici
exaly   +5 more sources

Fibonacci Generalized Quaternions

open access: yesAdvances in Applied Clifford Algebras, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akyiğit, Mahmut   +2 more
exaly   +6 more sources

Fibonacci-p Quaternions

open access: yesAdvances in Applied Clifford Algebras, 2014
The authors of this paper study the generalization of the Fibonacci quaternions to Fibonacci-\(p\) quaternions. On the base are the numbers of Fibonacci \(F_n\) with the recurrence formula \(F_{n+1} = F_{n} + F_{n-1}\), \(n\geq 1\) with initial values \(F_0 =0\), \(F_1 = 1\), and the numbers of Lucas \(L_{n+1} = L_{n} +L_{n-1}\), \(n\geq 1\) with \(L_0
Yalcin, Feyza, TAŞCI, DURSUN
exaly   +5 more sources

On higher order Fibonacci quaternions

open access: yesThe Journal of Analysis, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tiekoro Kone, Can Kızılateş
exaly   +5 more sources

Bicomplex Fibonacci quaternions

open access: yesChaos, Solitons & Fractals, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Torunbalcı Aydın   +1 more
exaly   +6 more sources

Home - About - Disclaimer - Privacy