Results 61 to 70 of about 3,254,389 (231)
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
Fibonacci Ideal Convergence on Intuitionistic Fuzzy Normed Linear Spaces
Fuzzy Information and Engineering, 2022 The main goal of this article is to present the notion of Fibonacci I-convergence of sequences on intuitionistic fuzzy normed linear space. To accomplish this goal, we mainly investigate some fundamental properties of the newly introduced notion.
Ömer Kişi, Pradip Debnath
doaj +1 more source
Generalized Fibonacci – Like Sequence Associated with Fibonacci and Lucas Sequences [PDF]
Turkish Journal of Analysis and Number Theory, 2016 The Fibonacci sequence, Lucas numbers and their generalization have many interesting properties and applications to almost every field. Fibonacci sequence is defined by the recurrence formula Fn=Fn-1+Fn-2, , and F0=0, F1=1, where Fn is a nth number of sequence.
Yogesh Kumar Gupta +2 more
openaire +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
Trees and Meta-Fibonacci Sequences [PDF]
The Electronic Journal of Combinatorics, 2009 For $k>1$ and nonnegative integer parameters $a_p, b_p$, $p = 1..k$, we analyze the solutions to the meta-Fibonacci recursion $C(n)=\sum_{p=1}^k C(n-a_p-C(n-b_p))$, where the parameters $a_p, b_p$, $p = 1..k$ satisfy a specific constraint. For $k=2$ we present compelling empirical evidence that solutions exist only for two particular families of ...
Isgur, Abraham +2 more
openaire +2 more sources
On Diophantine Equations Related to Order of Appearance in Fibonacci Sequence
Mathematics, 2019 Let F n be the nth Fibonacci number. Order of appearance z ( n ) of a natural number n is defined as smallest natural number k, such that n divides F k . In 1930, Lehmer proved that all solutions of equation z ( n ) = n ± 1 are prime numbers.
P. Trojovský
semanticscholar +1 more source
On a problem of Pillai with k-generalized Fibonacci numbers and powers of 2
, 2018 For an integer $ k\geq 2 $, let $ \{F^{(k)}_{n} \}_{n\geq 0}$ be the $ k$--generalized Fibonacci sequence which starts with $ 0, \ldots, 0, 1 $ ($ k $ terms) and each term afterwards is the sum of the $k$ preceding terms.
Ddamulira, M., Gómez, C., Luca, F.
core +1 more source
The Magnetic Signature of Stress in Rocks
Geophysical Research Letters, Volume 53, Issue 3, 16 February 2026.Abstract Magnetic signatures preserved in rocks have long provided insight into Earth's evolution, revealing processes from plate tectonics to the habitability of Earth. While large impacts are known to impose extreme stresses (>1 GPa) and heat that fundamentally alters magnetic records, lower stresses typical of earthquakes have been considered ...
B. R. Kugabalan +8 more
wiley +1 more source
International Journal of Advanced Mathematical Sciences, 2013 The Fibonacci and Lucas sequences are well-known examples of second order recurrence sequences, which belong to particular class of recursive sequences. In this article, Fibonacci-Like sequence is introduced and defined by 1 2 0 1 2 for 2 with 2 , 1. n n n H H H n H H The Binet’s formula and generating function of Fibonacci-Like sequence ...
Shikha Bhatnagar +2 more
openaire +2 more sources
The sequence of return words of the Fibonacci sequence [PDF]
Theoretical Computer Science, 2014 Let ω be a factor of the Fibonacci sequence F ∞ = x 1 x 2 ? , then it occurs in the sequence infinitely many times. Let ω p be the p-th occurrence of ω and r p ( ω ) be the p-th return word over ω. In this paper, we study the structure of the sequence of
Yuke Huang, Z. Wen
semanticscholar +1 more source