Results 21 to 30 of about 3,791 (167)
Diophantine equations with Lucas and Fibonacci number coefficients [PDF]
Notes on Number Theory and Discrete MathematicsFibonacci and Lucas numbers are special number sequences that have been the subject of many studies throughout history due to the relations they provide.
Cemil Karaçam +3 more
doaj +1 more source
Some identities for generalized Fibonacci and Lucas numbers
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper we study one parameter generalization of the Fibonacci numbers, Lucas numbers which generalizes the Jacobsthal numbers, Jacobsthal–Lucas numbers simultaneously. We present some their properties and interpretations also in graphs.
Anetta Szynal-Liana +2 more
doaj +1 more source
On (k,p)-Fibonacci numbers and matrices [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper, some relations between the powers of any matrices X satisfying the equation Xᵏ-pXᵏ⁻¹-(p-1)X-I=0 and (k,p)-Fibonacci numbers are established with ...
Sinan Karakaya +2 more
doaj +1 more source
An Alternating Sum of Fibonacci and Lucas Numbers of Order k
Mathematics, 2020 During the last decade, many researchers have focused on proving identities that reveal the relation between Fibonacci and Lucas numbers. Very recently, one of these identities has been generalized to the case of Fibonacci and Lucas numbers of order k ...
Spiros D. Dafnis +2 more
doaj +1 more source
Latent Diffusion Models for Virtual Battery Material Screening and Characterization
Batteries &Supercaps, EarlyView.A newly developed virtual tool is designed to enhance the extraction of meaningful information from characterization technique data and effectively guides the screening of target battery materials based on functional requirements. Efficient characterization of battery materials is fundamental to understanding the underlying electrochemical mechanisms ...
Deepalaxmi Rajagopal +3 more
wiley +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
Entanglement in Quantum Systems Based on Directed Graphs
Advanced Quantum Technologies, EarlyView.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
Karakteristik Graf Dengan Sisi Bilangan Fibonacci
Jurnal DerivatLet be a finite subset of Fibonacci numbers set. In this research, we construct a graph where the set of vertices contains integer numbers such that for every , there exist some edge in that satisfies the condition . By applying some properties
Darmajid, Dwi Mifta Mahanani
doaj +1 more source
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
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, EarlyView.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