Related papers: One Parameter Generalizations of the Fibonacci and…

We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…

For a set $A$ of positive integers with $\gcd(A)=1$, let $\langle A \rangle$ denote the set of all finite linear combinations of elements of $A$ over the non-negative integers. The it is well known that only finitely many positive integers…

We study matrices which transform the sequence of Fibonacci or Lucas polynomials with even index to those with odd index and vice versa. They turn out to be intimately related to generalized Stirling numbers and to Bernoulli, Genocchi and…

We show that if $k\ge 2$ is an integer and $(F_n^{(k)})_{n\ge 0}$ is the sequence of $k$-generalized Fibonacci numbers, then there are only finitely many triples of positive integers $1<a<b<c$ such that $ab+1,~ac+1,~bc+1$ are all members of…

The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.

In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…

We introduce the notion of Fibonacci and Lucas derivations of the polynomial algebras and prove that any element of kernel of the derivations defines a polynomial identity for the Fibonacci and Lucas polynomials. Also, we prove that any…

In this paper we derive some new identities involving the Fibonacci and Lucas polynomials and the Chebyshev polynomials of the first and the second kind. Our starting point is a finite trigonometric sum which equals the resolvent kernel on…

In this article, we will discover some new generalized identity regarding continued fractions. We will connect the results to Fibonacci numbers and Lucas numbers. For all the proof, we will use induction.

We calculate the Hankel determinants of sequences of Bernoulli polynomials. This corresponding Hankel matrix comes from statistically estimating the variance in nonparametric regression. Besides its entries' natural and deep connection with…

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…

Using continued fraction expansions of certain polygamma functions as a main tool, we find orthogonal polynomials with respect to the odd-index Bernoulli polynomials $B_{2k+1}(x)$ and the Euler polynomials $E_{2k+\nu}(x)$, for $\nu=0, 1,…

We derive several identities for arbitrary homogeneous second order recurrence sequences with constant coefficients. The results are then applied to present a unified study of six well known integer sequences, namely the Fibonacci sequence,…

We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…

One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…

In this paper, it is proved that there is an arithmetic progression of positive integers such that each of which is expressible neither as $p+F_m$ nor as $q+L_n$, where $ p,q $ are primes, $ F_m $ denotes the $ m $-th Fibonacci number and $…

Let $(U_{n}(P,Q) $ and $(V_{n}(P,Q) $ denote the generalized Fibonacci and Lucas sequence, respectively. In this study, we assume that $Q=1.$ We determine all indices $n$ such that $U_{n}=5\square $ and $U_{n}=5U_{m}\square $ under some…

Let $\UT_n(\FF_q)$ denote the group of unipotent $n\times n$ upper triangular matrices over a finite field with $q$ elements. We show that the Heisenberg characters of $\UT_{n+1}(\FF_q)$ are indexed by lattice paths from the origin to the…

This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let $F_{n}$ be the Fibonacci numbers defined by the recurrence relation $F_{1}=1$, $F_{2}=1$ and $F_{n}=F_{n-1}+F_{n-2}$ for all $n\geq 3$. We will find…

In this paper, we define the incomplete h(x)-Fibonacci and h(x)-Lucas polynomials, we study recurrence relations and some properties of these polynomials