Results 21 to 30 of about 2,369,502 (88)
A note on generalized hybrid tribonacci numbers [PDF]
, 2020 In this paper, we introduce the generalized hybrid Tribonacci numbers. These numbers can be considered as a generalization of the generalized complex Tribonacci, generalized hyperbolic Tribonacci and generalized dual Tribonacci numbers.
Yağmur, Tülay +2 more
core +2 more sources
On Matrix Sequence of modified Tribonacci-Lucas Numbers [PDF]
, 2022 In this paper, we define modified Tribonacci-Lucas matrix sequence and investigate its ...
Yüksel SOYKAN +2 more
core +2 more sources
Explicit Form of the Inverse Matrices of Tribonacci Circulant Type Matrices
Abstract and Applied Analysis, Volume 2015, Issue 1, 2015., 2015 It is a hot topic that circulant type matrices are applied to networks engineering. The determinants and inverses of Tribonacci circulant type matrices are discussed in the paper. Firstly, Tribonacci circulant type matrices are defined. In addition, we show the invertibility of Tribonacci circulant matrix and present the determinant and the inverse ...
Li Liu, Zhaolin Jiang, Zidong Wang
wiley +1 more source
On Partial Sum of Tribonacci Numbers
International Journal of Mathematics and Mathematical Sciences, Volume 2015, Issue 1, 2015., 2015 We study the sum st(k,r)=∑i=0tTki+r of k step apart Tribonacci numbers for any 1 ≤ r ≤ k. We prove that st(k,r) satisfies certain Tribonacci rule st(k,r)=akst-1(k,r)+bkst-2(k,r)+st-3(k,r)+λ with integers ak, bk, ck, and λ.
Eunmi Choi, Jiin Jo, Nawab Hussain
wiley +1 more source
Total Graph Interpretation of the Numbers of the Fibonacci Type
Journal of Applied Mathematics, Volume 2015, Issue 1, 2015., 2015 We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all (A1, 2A1)‐edge colourings in trees.
Urszula Bednarz +3 more
wiley +1 more source
Integer Semigroups Associated with Dumont‐Thomas Numeration Systems
International Scholarly Research Notices, Volume 2014, Issue 1, 2014., 2014 Given a primitive substitution, we define different binary operations on infinite subsets of the nonnegative integers. These binary operations are defined with the help of the Dumont‐Thomas numeration system; that is, a numeration system associated with the substitution. We give conditions for these semigroups to have an identity element.
Víctor F. Sirvent +5 more
wiley +1 more source
A STUDY ON THE SUMS OF SQUARES OF GENERALIZED TRIBONACCI NUMBERS: CLOSED FORM FORMULAS OF ∑_{k=0}ⁿkx^{k}W_{k}² [PDF]
, 2021 In this paper, closed forms of the sum formulas ∑_{k=0}ⁿkx^{k}W_{k}², ∑_{k=0}ⁿkx^{k}W_{k+2}W_{k} and ∑_{k=0ⁿkx^{k}W_{k+1}W_{k} for the squares of generalized Tribonacci numbers are presented.
Yüksel SOYKAN, SOYKAN, Yüksel
core +1 more source
Journal of Applied Mathematics, Volume 2014, Issue 1, 2014., 2014 The row first‐minus‐last right (RFMLR) circulant matrix and row last‐minus‐first left (RLMFL) circulant matrices are two special pattern matrices. By using the inverse factorization of polynomial, we give the exact formulae of determinants of the two pattern matrices involving Perrin, Padovan, Tribonacci, and the generalized Lucas sequences in terms of
Zhaolin Jiang +3 more
wiley +1 more source
Journal of Applied Mathematics, Volume 2012, Issue 1, 2012., 2012 Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph. By using the well‐known property which states the (i, j) entry of Am (A is adjacency matrix) is equal to the number of ...
Fatih Yılmaz +2 more
wiley +1 more source
A Hybrid Matrix–Based Encoding Scheme With Error Detection via Third‐Order Recurrences
Journal of Mathematics, Volume 2026, Issue 1, 2026.In this paper, we propose a novel encoding–decoding algorithm based on third‐order linear recurrence sequences and their associated matrix representations. In particular, third‐order Jacobsthal and third‐order Jacobsthal–Lucas matrix sequences are combined with Padovan and Perrin matrix sequences to construct a hybrid block–based coding scheme.
Sukran Uygun, Smritijit Sen
wiley +1 more source