Related papers: Fibonacci, Lucas, and Spread Polynomials
Using generating functions, we derive many identities involving balancing and Lucas-balancing polynomials. By relating these polynomials to Chebyshev polynomials of the first and second kind, and Fibonacci and Lucas numbers, we offer some…
We give new identities for some symmetric polynomials. As applications of these identities, we obtain some formulas for a higher order analogue of Fibonacci and Lucas numbers.
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…
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 study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…
We study a bivariate variant of Hans-Christian Herbig's version of Norman Wildberger's spread polynomials.
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
It is shown that some q-analogues of the Fibonacci and Lucas polynomials lead to q-analogues of the Chebyshev polynomials which retain most of their elementary properties.
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.…
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.…
In this paper, we provide new applications of Fibonacci and Lucas numbers. In some circumstances, we find algebraic structures on some sets defined with these numbers, we generalize Fibonacci and Lucas numbers by using an arbitrary binary…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…
In this paper, we investigated properties of Tribonacci-Lucas polynomials which generalized Tribonacci-Lucas numbers. From this generalization, we also obtain some new algebraic properties on these numbers and polynomials as Binet formula,…
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients.
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…
In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…
A full characterization of $(p,q)$-deformed Fibonacci and Lucas polynomials is given. These polynomials obey non-conventional three-term recursion relations. Their generating functions and Fourier integral transforms are explicitly computed…
Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.