Results 41 to 50 of about 320 (182)

Total Variation Regularized GRACE(‐FO) Inversion

Journal of Geophysical Research: Solid Earth, Volume 131, Issue 5, May 2026.
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, S. Bettadpur, H. Save, P. Nagel, F. Wang   +4 more
wiley   +1 more source

On some properties of generalized Fibonacci and Lucas polynomials

, 2017
In this paper we investigate some properties of generalized Fibonacci and Lucas polynomials. We give some new identities using matrices and Laplace expansion for the generalized Fibonacci and Lucas polynomials.
Sümeyra Uçar
core   +1 more source

On Sequences of Numbers and Polynomials Defined by Linear Recurrence Relations of Order 2

International Journal of Mathematics and Mathematical Sciences, 2009
Here we present a new method to construct the explicit formula of a sequence of numbers and polynomials generated by a linear recurrence relation of order 2.
Tian-Xiao He, Peter J.-S. Shiue
doaj   +1 more source

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

Mathematika, Volume 72, Issue 2, April 2026.
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

An algorithm for complex factorization of the bi-periodic Fibonacci and Lucas polynomials [PDF]

Notes on Number Theory and Discrete Mathematics
In this paper, we consider the factorization of generalized sequences, by employing a method based on trigonometric identities. The new method is of reduced complexity and represents an improvement compared to existing results.
Baijuan Shi, Can Kızılateş
doaj   +1 more source

Zarankiewicz bounds from distal regularity lemma

Bulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
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

Generalized Fibonacci-Lucas Polynomials

International Journal of Advanced Mathematical Sciences, 2013
Various sequences of polynomials by the names of Fibonacci and Lucas polynomials occur in the literature over a century. The Fibonacci polynomials and Lucas polynomials are famous for possessing wonderful and amazing properties and identities. In this paper, Generalized Fibonacci-Lucas Polynomials are introduced and defined by the recurrence relation 
Mamta Singh, Omprakash Sikhwal, Vibhoj Parsai, Yogesh Gupta   +3 more
openaire   +2 more sources

A Generalization of Gaussian Balancing and Gaussian Balancing‐Lucas Numbers With Applications

International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.
In this paper, we study a generalization of Gaussian balancing and Gaussian Lucas‐balancing numbers, we find their generating functions, Binet formulas, related matrix representation, and many other properties. Also, we provide some applications in cryptography.
T. Al-Asoully, A. Al-Kateeb, Abdul Rauf Khan   +2 more
wiley   +1 more source

Cryptography using Fibonacci-Mersenne and Fibonacci-balancing p-sequences with a self-invertible matrix and the Affine-Hill cipher [PDF]

Notes on Number Theory and Discrete Mathematics
In this paper, we define two new sequences using the Fibonacci p-numbers, the generalized Mersenne numbers, and m-balancing numbers. These sequences are obtained from the corresponding characteristic polynomials.
Elahe Mehraban, T. Aaron Gulliver, Ömür Deveci, Evren Hincal   +3 more
doaj   +1 more source

Computational Framework for Numerical Simulation of Fractional‐Order Financial Crime Model via Lucas Collocation Technique

Journal of Applied Mathematics, Volume 2026, Issue 1, 2026.
The Lucas collocation approach is used in this study to approximate a fractional‐order financial crime model (FOFCM) numerically. The model categorizes the population into five groups: persons without a financial criminal past, those inclined toward financial crimes, active participants, individuals undergoing prosecution, and those imprisoned.
Mahmoud Abd El-Hady, Homan Emadifar, Mehdi Hariri, Atallah El-Shenawy, Chong Lin   +4 more
wiley   +1 more source