We prove that the sequence $(1/F_{n+2})_{n\ge 0}$ of reciprocals of the Fibonacci numbers is a moment sequence of a certain discrete probability, and we identify the orthogonal polynomials as little $q$-Jacobi polynomials with $q=(1-\sqrt{5})/(1+\sqrt{5})$. We prove that the corresponding kernel polynomials have integer coefficients, and from this we deduce that the inverse of the corresponding Hankel matrices $(1/F_{i+j+2})$ have integer entries. We prove analogous results for the Hilbert matrices.
Let $p$ be a prime. In this paper, we give a complete classification of self-reciprocal polynomials arising from Fibonacci polynomials over $\mathbb{Z}$ and $\mathbb{Z}_p$, where $p=2$ and $p>5$. We also present some partial results when $p=3, 5$. We also compute the first and second moments of Fibonacci polynomials $f_{n}(x)$ over finite fields, which give necessary conditions for Fibonacci polynomials to be permutation polynomials over finite fields.
We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the convolved h(x)-Fibonacci polynomials form a family of Hessenberg matrices.
In this paper, we give some determinantal and permanental representations of generalized bivariate Fibonacci p-polynomials by using various Hessenberg matrices. The results that we obtained are important since generalized bivariate Fibonacci p-polynomials are general form of, for example, bivariate Fibonacci and Pell p-polynomials, second kind Chebyshev polynomials, bivariate Jacobsthal polynomials etc.
A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are irreducible if and only if $n$ is a prime number. For example, the Fibonacci polynomials, Pell polynomials, Fermat polynomials, Lucas polynomials, Pell-Lucas polynomials, Fermat-Lucas polynomials are irreducible when $n$ is a prime number; and Chebyshev polynomials (second kind), Morgan-Voyce polynomials (Fibonacci type), and Vieta polynomials are reducible when…
In this note, we obtain some identities for the generalized Fibonacci polynomial by using the Q(x) matrix. These identities including the Cassini identity and Honsberger formula can be applied to some polynomial sequences, such as Fibonacci polynomials, Lucas polynomials, Pell polynomials, Pell-Lucas polynomials, Fermat polynomials, Fermat-Lucas polynomials, and so on.
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
In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence modulo an integer, $m$ and derive certain interesting properties related to them. Afterwards, we derive some new properties of a class of generalized Fibonacci numbers. In the last part of the paper we introduce some generalized Fibonacci polynomial sequences and we derive some results related to them.
In this paper, we consider the matrix polynomial obtained by using bi-periodic Fibonacci matrix polynomial. Then, we give some properties and binomial transforms of the new matrix polynomials.
A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and Lucas numbers to Fibonacci type and Lucas type polynomials. A Fibonacci type polynomial is equivalent to a Lucas type polynomial if they both satisfy the same recurrence relations. Most of the identities provide relationships between two equivalent polynomials. In particular, each type of identities in this paper relate the following polynomial sequences: Fibona…
A second order polynomial sequence is of \emph{Fibonacci-type} (\emph{Lucas-type}) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Known examples of these type of sequences are: Fibonacci polynomials, Pell polynomials, Fermat polynomials, Chebyshev polynomials, Morgan-Voyce polynomials, Lucas polynomials, Pell-Lucas polynomials, Fermat-Lucas polynomials, Chebyshev polynomials. The \emph{resultant} of two polynomials is the determinant of the Sylvester matrix and the \emph{discriminant} of a polynomial $p$ is the resultant of $p$ and its derivative. We study …
In this paper, we give some determinantal and permanental representations of Generalized Fibonacci Polynomials by using various Hessenberg matrices. These results are general form of determinantal and permanental representations of k sequences of the generalized order-k Fibonacci and Pell numbers.
In this paper we generalize to bivariate polynomials of Fibonacci and Lucas, properties obtained for Chebyshev polynomials. We prove that the coordinates of the bivariate polynomials over appropriate basis are families of integers satisfying remarkable recurrence relations.
We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers. Moreover, we prove a special identity involving Bernoulli polynomials and Fibonacci numbers in arithmetic progression. Special cases and some corollaries will highlight interesting aspects of our findings. Our results complement and generalize these of Frontczak (2019).
We establish new connection formulae between Fibonacci polynomials and Chebyshev polynomials of the first and second kinds. These formulae are expressed in terms of certain values of hypergeometric functions of the type 2F1. Consequently, we obtain some new expressions for the celebrated Fibonacci numbers and their derivatives sequences. Moreover, we evaluate some definite integrals involving products of Fibonacci and Chebyshev polynomials.
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a new recurrence relation for the r-th partial derivative sequence of bivariate Fibonacci polynomials.
We show that certain weighted Fibonacci and Lucas series can always be expressed as linear combinations of polylogarithms. In some special cases we evaluate the series in terms of Bernoulli polynomials, making use of the connection between these polynomials and the polylogarithm.
It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study the generalized Fibonacci polynomials and classify them in two types depending on their Binet formula. We give a complete characterization for those polynomials that satisfy the strong divisibility property. We also giveformulas to calculate the $\gcd$ of those polynomials that do not satisfy the strong divisibility property. Note. This paper is now published…
We prove recurrence relations and modulo periodic properties of multiple derivatives of Fibonacci polynomials. We apply the obtained results to present the dynamic structures of Fibonacci polynomials over the ring of 2-adic integers by investigating minimal decompositions which consist of minimal subsystems and attracting basins.
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 polynomial identity for Appel polynomial yields a polynomial identity for the Fibonacci and Lucas polynomials and describe the corresponding intertwining maps.
The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential) generating functions to each other. As a consequence, we also establish new combinatorial identities for balancing polynomials and Fibonacci (Lucas) numbers.
In this paper, as an analogue of the integer case, we study detailedly the period and the rank of the generalized Fibonacci sequence of polynomials over a finite field modulo an arbitrary polynomial. We establish some formulas to compute them, and we also obtain some properties about the quotient of the period and the rank. We find that the polynomial case is much more complicated than the integer case.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
Chebyshev polynomials and their modifications are attributes of various fields of mathematics. In particular, they are generating functions of the rows elements of certain Riordan matrices. In paper, we give a selection of some characteristic situations in which such matrices are involved. Using the columns and rows of these matrices, we will build the bases of the space of formal power series and the space of polynomials, the properties of which allow us to call them "Fibonacci bases".
In this paper, we give two new coding algorithms by means of right circulant matrices with elements generalized Fibonacci and Lucas polynomials. For this purpose, we study basic properties of right circulant matrices using generalized Fibonacci polynomials $F_{p,q,n}\left( x\right) $, generalized Lucas polynomials $L_{p,q,n}\left( x\right) $ and geometric sequences.
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the Fibonaccis, the Tribonaccis, the Tetranaccis, and so on.
We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $π$ involving Fibonacci and Lucas numbers. Our findings complement those of Castellanos from 1986 and 1989.
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 tangent numbers and give rise to various identities between these numbers. There is also a close connection with the Akiyama-Tanigawa algorithm.
In this paper, firstly, we define the Qq-generating matrix for bi-periodic Fibonacci polynomial. And we give nth power, determinant and some properties of the bi-periodic Fibonacci polynomial by considering this matrix representation. Also, we introduce the Hadamard products for bi-periodic Fibonacci Qnq generating matrix and bi-periodic Lucas Qnl generating matrix of which entries is bi-periodic Fibonacci and Lucas numbers. Then, we investigate some properties of these products.
We study ratio limits of the consecutive terms of weighted $n$-generalized Fibonacci sequences generated from arbitrary complex initial conditions by linear recurrences with arbitrary complex weights. We prove that if the characteristic polynomial of such a linear recurrence is asymptotically simple, then the ratio limit exists for any sequence generated from arbitrary nontrivial initial conditions and it is equal to the unique zero of the characteristic polynomial.
We extend Fibonacci numbers with arbitrary weights and generalize a dozen Fibonacci identities. As a special case, we propose an elliptic extension which extends the $q$-Fibonacci polynomials appearing in Schur's work. The proofs of most of the identities are combinatorial, extending the proofs given by Benjamin and Quinn, and in the $q$ case, by Garrett. Some identities are proved by telescoping.
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with congruent indices we derived general formula in terms of generalized Fibonacci polynomials and Lucas numbers. By extending Binet formula to arbitrary real numbers we constructed Binet-Fibonacci curve in complex plane. For positive numbers the curve is oscillating with exponentially vanishing amplitude, while for negative numbers it becomes Binet Fibonacci spir…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined by {n choose k} = {n}!/({k}!{n-k}!) where {n}! = {1}{2}...{n}. These quotients are also polynomials in s and t, and specializations give the ordinary binomial coefficients, the Fibonomial coefficients, and the q-binomial coefficients. We present some of their fundamental properties, including a more general recursion for {n}, an analogue of the binomial the…
In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev polynomials of the first and second kind. We obtain recurrence relations and several properties of these polynomials. We show that there are connections between incomplete q-Chebyshev polynomials and the some well-known polynomials. Keywords: q-Chebyshev polynomials, q-Fibonacci polynomials, Incomplete polynomials, Fibonacci number
We present some results about the number of rational points on a certain family of curves defined over a finite field. In a small number of cases the curves have more rational points than expected. Fibonacci numbers make an appearance, as do cyclotomic polynomials.
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also give some identities known in special Jordan Algebras. The matrices play a bridge role between both theories. The mentioned matrices connect both areas of mathematics, special Jordan algebras and recurrence relations, to obtain new identities and classic identities in Fibonacci numbers, Lucas numbers, Pell numbers, binomial transform, tribonacci numbers, and po…
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences, where the underlying prime congruence structures of the rational sequence denominators enables the integer sequence to be recovered. From either the rational or the integer sequences we construct sequences of vectors in $\mathbb{Q}^m$, which converge to irrational algebraic points in $\mathbb{R}^m$. The rational sequence terms can be expressed as simple recurren…
We establish some new combinatorial identities involving Euler polynomials and balancing (Lucas-balancing) polynomials. The derivations use elementary techniques and are based on functional equations for the respective generating functions. From these polynomial relations, we deduce interesting identities with Fibonacci and Lucas numbers, and Euler numbers. The results must be regarded as companion results to some Fibonacci-Bernoulli identities, which we derived in our previous paper.
In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas numbers and generalized order-k Fibonacci numbers. In addition, we obtain Binet formula and combinatorial representation for generalized order-k Lucas numbers by using properties of generalized Fibonacci numbers.
We study a family of finite--dimensional representations of the hyperspecial parabolic subalgebra of the twisted affine Lie algebra of type $\tt A_2^{(2)}$. We prove that these modules admit a decreasing filtration whose sections are isomorphic to stable Demazure modules in an integrable highest weight module of sufficiently large level. In particular, we show that any stable level $m'$ Demazure module admits a filtration by level $m$ Demazure modules for all $m\ge m'$. We define the graded and weighted generating functions which encode the multiplicity of a given Demazure module and establish…
