Results 51 to 60 of about 973 (216)
Mind the Gap: Linking Refactorings and Code Smells in Elixir
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 the Products of k-Fibonacci Numbers and k-Lucas Numbers
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 +2 more
doaj +1 more source
The Fibonacci numbers of certain subgraphs of circulant graphs
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 +1 more
doaj +1 more source
Total Variation Regularized GRACE(‐FO) Inversion
Abstract Gravity estimation from satellite‐satellite tracking missions such as GRACE(‐FO) is an ill‐posed inverse problem. The conventional approach to regularized inversion of GRACE(‐FO) measurements uses L2 ${L}_{2}$‐Tikhonov regularization with a heuristic constraint matrix derived based on knowledge of spatiotemporal distribution of the signal ...
G. Jacob +4 more
wiley +1 more source
Closed forms for finite sums of weighted products of generalized Fibonacci numbers [PDF]
In this paper, we present closed forms for certain finite sums of weighted products of generalized Fibonacci numbers. Indeed, we present seven multi-parameter families of such finite sums, all of which we believe to be new. In each of these families, the
Melham, RS
core
Generalized Fibonacci Numbers: Sum Formulas
In this paper, closed forms of the summation formulas for generalized Fibonacci numbers are presented. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers.
Yüksel Soykan
core +1 more source
Some Properties of Generalized Apostol-Type Frobenius–Euler–Fibonacci Polynomials
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 +3 more
doaj +1 more source
Hausdorff dimension of double‐base expansions and binary shifts with a hole
Abstract For two real bases q0,q1>1$q_0, q_1 > 1$, a binary sequence i1i2⋯∈{0,1}∞$i_1 i_2 \cdots \in \lbrace 0,1\rbrace ^\infty$ is the (q0,q1)$(q_0,q_1)$‐expansion of the number πq0,q1(i1i2⋯)=∑k=1∞ikqi1⋯qik.$$\begin{equation*} \pi _{q_0,q_1}(i_1 i_2 \cdots) = \sum _{k=1}^\infty \frac{i_k}{q_{i_1} \cdots q_{i_k}}.
Jian Lu, Wolfgang Steiner, Yuru Zou
wiley +1 more source
Novel Expressions for Certain Generalized Leonardo Polynomials and Their Associated Numbers
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 +3 more
doaj +1 more source
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley +1 more source

