Results 71 to 80 of about 1,044,414 (185)
Twisted rational zeros of linear recurrence sequences
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract We introduce the notion of a twisted rational zero of a nondegenerate linear recurrence sequence (LRS). We show that any nondegenerate LRS has only finitely many such twisted rational zeros. In the particular case of the Tribonacci sequence, we show that 1/3$1/3$ and −5/3$-5/3$ are the only twisted rational zeros that are not integral zeros.
Yuri Bilu +4 more
wiley +1 more source
THE GENERALIZED BINET FORMULA, REPRESENTATION AND SUMS OF THE GENERALIZED ORDER-$k$ PELL NUMBERS
Taiwanese Journal of Mathematics, 2006 In this paper we give a new generalization of the Pell numbers in matrix representation. Also we extend the matrix representation and we show that the sums of the generalized order-k Pell numbers could be derived directly using this representation. Further we present some identities, the generalized Binet formula and combinatorial representation of the
Kiliç, Emrah, Taşci, Dursun
openaire +4 more sources
DCMCF: Dynamic Cross‐Modal Context Fusion for Image‐Based Person Search
IET Image Processing, Volume 19, Issue 1, January/December 2025.This paper proposes dynamic cross‐modal context fusion, a novel framework for image‐based person search that dynamically enhances multi‐view visual representations with automatically generated multi‐level textual descriptions. By integrating cross‐modal context through adaptive fusion and text‐guided re‐ranking, our method achieves state‐of‐the‐art ...
Fudong Nian +4 more
wiley +1 more source
Fibonacci Hierarchies for Decision Making [PDF]
All decisions are practically made within a chainwise social setup named a decision-making chain (DMC). This paper considers some cases of an idea (a project proposal) propagating through an organizational DMC.
Tokel, Emre, Yucel, Eray
core +1 more source
Binet – Type Formula For The Sequence of Tetranacci Numbers by Alternate Methods
Mathematical Journal of Interdisciplinary Sciences, 2019 The sequence {Tn} of Tetranacci numbers is defined by recurrence relation Tn= Tn-1 + Tn-2 + Tn-3 + Tn-4; n≥4 with initial condition T0=T1=T2=0 and T3=1. In this Paper, we obtain the explicit formulla-Binet-type formula for Tn by two different methods. We use the concept of Eigen decomposition as well as of generating functions to obtain the result.
null Gautam S. Hathiwala +1 more
openaire +2 more sources
Special MatricesIn this article, we establish a new closed formula for the solution of homogeneous second-order linear difference equations with constant coefficients by using matrix theory.
Kaddoura Issam, Mourad Bassam
doaj +1 more source
Stirling's Original Asymptotic Series from a Formula like one of Binet's\n and its Evaluation by Sequence Acceleration [PDF]
, 2018 Robert M. Corless, Leili Rafiee Sevyeri
openalex +1 more source
A new approach to Leonardo number sequences with the dual vector and dual angle representation
AIMS MathematicsIn this paper, we introduce dual numbers with components including Leonardo number sequences. This novel approach facilitates our understanding of dual numbers and properties of Leonardo sequences.
Faik Babadağ, Ali Atasoy
doaj +1 more source
A comparison of performance of subnormal, normal, and gifted children on the Oseretsky Tests of Motor Proficiency. [PDF]
, 1957 Thesis (Ed.D.)--Boston ...
Berk, Robert Lloyd
core +1 more source
Generalization of the 2-Fibonacci sequences and their Binet formula
Notes on Number Theory and Discrete MathematicsWe will explore the generalization of the four different 2-Fibonacci sequences defined by Atanassov. In particular, we will define recurrence relations to generate each part of a 2-Fibonacci sequence, discuss the generating function and Binet formula of each of these sequences, and provide the necessary and sufficient conditions to obtain each type of ...
Timmy Ma, Richard Vernon, Gurdial Arora
openaire +1 more source