Results 71 to 80 of about 1,912,276 (202)
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
Mersenne-Horadam identities using generating functions
The main object of the present paper is to reveal connections between Mersenne numbers $M_n=2^n-1$ and generalized Fibonacci (i.e., Horadam) numbers $w_n$ defined by a second order linear recurrence $w_n=pw_{n-1}+qw_{n-2}$, $n\geq 2$, with $w_0=a$ and ...
R. Frontczak, T.P. Goy
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
Some sums related to the terms of generalized Fibonacci autocorrelation sequences
In this paper, we give the terms of the generalized Fibonacci autocorrelation sequences defined as and some interesting sums involving terms of these sequences for an odd integer number and nonnegative integers.
Neşe Ömür , Sibel Koparal
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
A Quadratic Diophantine Equation Involving Generalized Fibonacci Numbers
The sequence of the k-generalized Fibonacci numbers ( F n ( k ) ) n is defined by the recurrence F n ( k ) = ∑ j = 1 k F n − j ( k ) beginning with the k terms 0 , … , 0 , 1 .
Ana Paula Chaves, Pavel Trojovský
doaj +1 more source
Zarankiewicz bounds from distal regularity lemma
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley +1 more source
Entanglement in Quantum Systems Based on Directed Graphs
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
A curious property of series involving terms of generalized sequences
Here we are concerned with series involving generalized Fibonacci numbers Un (p,q) and generalized Lucas numbers Vn (p,q). The aim of this paper is to find triples (p,q,r) for which the series Un (p,q)/rn and Vn (p,q)/rn (for r running from 0 to ...
Odoardo Brugia, Piero Filipponi
doaj +1 more source
On Bicomplex Fibonacci Numbers and Their Generalization
In this chapter, we consider bicomplex numbers with coefficients from Fibonacci sequence and give some identities. Moreover, we demonstrate the accuracy of such identities by taking advantage of idempotent representations of the bicomplex numbers. And then by this representation, we give some identities containing these numbers.
openaire +5 more sources

