Results 61 to 70 of about 1,912,276 (202)

Novel Expressions for Certain Generalized Leonardo Polynomials and Their Associated Numbers

Axioms
This article introduces new polynomials that extend the standard Leonardo numbers, generalizing Fibonacci and Lucas polynomials. A new power form representation is developed for these polynomials, which is crucial for deriving further formulas.
Waleed Mohamed Abd-Elhameed, Omar Mazen Alqubori, Abdulrahim A. Alluhaybi, Amr Kamel Amin   +3 more
doaj   +1 more source

On the Products of k-Fibonacci Numbers and k-Lucas Numbers

International Journal of Mathematics and Mathematical Sciences, 2014
In this paper we investigate some products of k-Fibonacci and k-Lucas numbers. We also present some generalized identities on the products of k-Fibonacci and k-Lucas numbers to establish connection formulas between them with the help of Binet's formula.
Bijendra Singh, Kiran Sisodiya, Farooq Ahmad   +2 more
doaj   +1 more source

Fibonacci Numbers of Generalized Fibonacci Graphs

Mediterranean Journal of Mathematics
Abstract The Fibonacci number of a graph, introduced by Prodinger and Tichy, is defined as the total number of independent vertex sets, including the empty set, and it is closely related to the Merrifield–Simmons index in chemical graph theory.
Emrah Akyar, Handan Akyar
openaire   +1 more source

Embodied Responses to Harmony and (Poly)Rhythm: An Integrated Ratio‐Based Perception‐Action Framework

Annals of the New York Academy of Sciences, Volume 1562, Issue 1, August 2026.
Harmony and rhythm perception are often studied separately, yet both reveal a shared sensitivity to low‐order integer ratios. In harmony, intervals like the octave (2:1) and fifth (3:2) predict consonance and ease of encoding. In rhythm, patterns with simple ratios (e.g., 2:1, 3:2) are easier to perceive, reproduce, and remember.
Nicola Di Stefano, Edward Large, Charles Spence   +2 more
wiley   +1 more source

Some properties and extended Binet’s formula for the class of bifurcating Fibonacci sequence

Ratio Mathematica
One 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, Devbhadra V Shah, Vandana R Patel   +2 more
doaj   +1 more source

The Fibonacci numbers of certain subgraphs of circulant graphs

AKCE International Journal of Graphs and Combinatorics, 2015
The Fibonacci number ℱ(G) of a graph G with vertex set V(G), is the total number of independent vertex sets S⊂V(G); recall that a set S⊂V(G) is said to be independent whenever for every two different vertices u,v∈S there is no edge between them.
Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez   +1 more
doaj   +1 more source

On Types of Distance Fibonacci Numbers Generated by Number Decompositions [PDF]

Journal of Applied Mathematics, 2014
We introduce new types of distance Fibonacci numbers which are closely related with number decompositions. Using special decompositions of the numbernwe give a sequence of identities for them. Moreover, we give matrix generators for distance Fibonacci numbers and their direct formulas.
Anetta Szynal-Liana, Andrzej Wloch, Iwona Wloch   +2 more
openaire   +5 more sources

Skew shapes, Ehrhart positivity, and beyond

Proceedings of the London Mathematical Society, Volume 133, Issue 2, August 2026.
Abstract A classical result by Kreweras (1965) allows one to compute the number of plane partitions of a given skew shape and bounded parts as certain determinants. We prove that these determinants expand as polynomials with nonnegative coefficients.
Luis Ferroni, Alejandro H. Morales, Greta Panova   +2 more
wiley   +1 more source

Mind the Gap: Linking Refactorings and Code Smells in Elixir

Journal of Software: Evolution and Process, Volume 38, Issue 5, May 2026.
ABSTRACT Elixir is a functional programming language increasingly used in the industry to develop scalable and fault‐tolerant concurrent systems more easily and with fewer computational resources. In previous studies, we cataloged 35 code smells and 82 refactorings tailored for this language, validating them with over 300 experienced developers ...
Lucas Vegi, Marco Túlio Valente
wiley   +1 more source

On generalized bicomplex k-Fibonacci numbers [PDF]

, 2019
In this paper, we introduce the generalized bicomplex k-Fibonacci numbers. We also give the generating function and Binet's formula for these numbers.
Yağmur, Tülay
core   +1 more source