Results 81 to 90 of about 48,003 (223)

Latent Diffusion Models for Virtual Battery Material Screening and Characterization

Batteries &Supercaps, Volume 8, Issue 12, December 2025.
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, Arnd Koeppe, Adrian Cierpka, Britta Nestler   +3 more
wiley   +1 more source

Some Properties of Generalized Apostol-Type Frobenius–Euler–Fibonacci Polynomials

Mathematics
In this paper, by using the Golden Calculus, we introduce the generalized Apostol-type Frobenius–Euler–Fibonacci polynomials and numbers; additionally, we obtain various fundamental identities and properties associated with these polynomials and numbers,
Maryam Salem Alatawi, Waseem Ahmad Khan, Can Kızılateş, Cheon Seoung Ryoo   +3 more
doaj   +1 more source

Novel Results for Two Generalized Classes of Fibonacci and Lucas Polynomials and Their Uses in the Reduction of Some Radicals

Mathematics, 2022
The goal of this study is to develop some new connection formulae between two generalized classes of Fibonacci and Lucas polynomials. Hypergeometric functions of the kind 2F1(z) are included in all connection coefficients for a specific z.
Waleed Mohamed Abd-Elhameed, Andreas N. Philippou, Nasr Anwer Zeyada   +2 more
doaj   +1 more source

Generalized Compositions and Weighted Fibonacci Numbers [PDF]

, 2010
In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient.
Janjic, Milan
core  

On Higher-Order Generalized Fibonacci Hybrid Numbers with q-Integer Components: New Properties, Recurrence Relations, and Matrix Representations

Symmetry
Many properties of special numbers, such as sum formulas, symmetric properties, and their relationships with each other, have been studied in the literature with the help of the Binet formula and generating function.
C. Kızılateş, E. Polatlı, Nazlıhan Terzioğlu, Wei-Shih Du   +3 more
semanticscholar   +1 more source

(Random) Trees of Intermediate Volume Growth

Random Structures &Algorithms, Volume 67, Issue 4, December 2025.
ABSTRACT For every function g:ℝ≥0→ℝ≥0$$ g:{\mathbb{R}}_{\ge 0}\to {\mathbb{R}}_{\ge 0} $$ that grows at least linearly and at most exponentially, if it is sufficiently well‐behaved, we can construct a tree T$$ T $$ of uniform volume growth g$$ g $$, or more precisely, C1·g(r/4)≤|BG(v,r)|≤C2·g(4r),for allr≥0andv∈V(T),$$ {C}_1\cdotp g\left(r/4\right)\le \
George Kontogeorgiou, Martin Winter
wiley   +1 more source

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

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

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