Results 31 to 40 of about 3,828 (164)
On the arrowhead-Fibonacci numbers
Open Mathematics, 2016 In this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of the k-step Fibonacci sequence and then we give some of their properties.
Gültekin Inci, Deveci Ömür
doaj +1 more source
Determinants and inverses of circulant matrices with complex Fibonacci numbers
Special Matrices, 2015 Let ℱn = circ (︀F*1 , F*2, . . . , F*n︀ be the n×n circulant matrix associated with complex Fibonacci numbers F*1, F*2, . . . , F*n. In the present paper we calculate the determinant of ℱn in terms of complex Fibonacci numbers.
Altınışık Ercan +2 more
doaj +1 more source
Bidiagonal Decompositions and Accurate Computations for the Ballot Table and the Fibonacci Matrix
Numerical Linear Algebra with Applications, Volume 33, Issue 1, February 2026.ABSTRACT Riordan arrays include many important examples of matrices. Here we consider the ballot table and the Fibonacci matrix. For finite truncations of these Riordan arrays, we obtain bidiagonal decompositions. Using them, algorithms to solve key linear algebra problems for ballot tables and Fibonacci matrices with high relative accuracy are derived.
Jorge Ballarín +2 more
wiley +1 more source
On Generalized Fibonacci Numbers
Communications in Advanced Mathematical Sciences, 2020 Fibonacci numbers and their polynomials have been generalized mainly by two ways: by maintaining the recurrence relation and varying the initial conditions, and by varying the recurrence relation and maintaining the initial conditions. In this paper, we
Isaac Owino Okoth, Fidel Oduol
doaj +1 more source
Entanglement in Quantum Systems Based on Directed Graphs
Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.The entanglement properties of quantum states associated with directed graphs are investigated. It is proved that the vertex degree distribution fully determines this entanglement measure, which remains invariant under vertex relabeling, thereby highlighting its topological character.
Lucio De Simone, Roberto Franzosi
wiley +1 more source
Some properties and extended Binet’s formula for the class of bifurcating Fibonacci sequence
Ratio MathematicaOne of the generalizations of Fibonacci sequence is a -Fibonacci sequence, which is further generalized in several other ways, some by conserving the initial conditions and others by conserving the related recurrence relation.
Daksha Manojbhai Diwan +2 more
doaj +1 more source
Sums of Fibonacci numbers close to a power of 2 [PDF]
, 2022 Elchin Hasanalizade
openalex +1 more source
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Dual Proximal Groups Concisely Representing Complex Hosoya Triangles
Advances in Mathematical Physics, Volume 2026, Issue 1, 2026.This paper introduces dual proximal groups (DPGs) that provide concise representation of complex Hosoya triangles (CHTs). An application is given in terms of the DPG representation of collections of Hosoya‐Hilbert circular triangles on modulated motion waveforms in sequences of video frames. MSC2020 Classification: 11B39,54E05,57S25.
Kübra Gül +3 more
wiley +1 more source
A simple proof for generalized Fibonacci numbers with dying rabbits [PDF]
, 2023 Roberto De Prisco
openalex +1 more source