Results 91 to 100 of about 2,080 (215)
Linear regression with Fibonacci-derived polynomials for temperature prediction model
Discover DataThis research work explores the integration of Fibonacci-derived polynomial and linear equations from Fibonacci numbers into a machine learning framework for predictive modeling of environmental datasets, such as wind speed, temperature, and humidity ...
Ahmed O. Ameen, Johnson O. Fashanu
doaj +1 more source
Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers
, 2005 In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.
Egge, Eric C., Mansour, Toufik
openaire +1 more source
Hybrid convolutions on Pell and Lucas polynomials [PDF]
Discrete Mathematics Letters, 2021 Dongwei Guo, Wenchang Chu
doaj +1 more source
Total Graph Interpretation of the Numbers of the Fibonacci Type
Journal of Applied Mathematics, 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
Urszula Bednarz +2 more
doaj +1 more source
On a subclass of bi-univalent functions related to shell-like curves connected with Fibonacci number
, 2020 Jenifer Arulmani
openalex +2 more sources
Several closed and determinantal forms for convolved Fibonacci numbers [PDF]
Discrete Mathematics Letters, 2021 Muhammet Cihat Daglı, Feng Qi
doaj +1 more source
A Curious Property of the Eleventh Fibonacci Number [PDF]
, 1995 B.M.M. de Weger
openalex +1 more source
Lyndon words and Fibonacci numbers
Journal of Combinatorial Theory, Series A, 2014 It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1 for the number of distinct Lyndon factors that a Lyndon word of length n must have, but this bound is not optimal.
openaire +3 more sources
Turán Graphs, Stability Number, and Fibonacci Index [PDF]
, 2008 Véronique Bruyère, Hadrien Mélot
openalex +1 more source