Related papers: Additional close links between balancing and Lucas…
Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…
The generating function of the second kind bivariate Chebyshev polynomials associated with the simple Lie algebra $G_2$ is constructed by the method proposed in \cite{DKS} and \cite{DKS1}.
This contribution presents all possible solutions to the Diophantine equations $F_k=L_mL_n$ and $L_k=F_mF_n$. To be clear, Fibonacci numbers that are the product of two arbitrary Lucas numbers and Lucas numbers that are the product of two…
Sury's 2014 proof of an identity for Fibonacci and Lucas numbers (Identity 236 of Benjamin and Quinn's 2003 book: {\em Proofs that count: The art of combinatorial proof}) has excited a lot of comment. We give an alternate, telescoping,…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
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…
We present a number of identities involving standard and associated Laguerre polynomials. They include double-, and triple-lacunary, ordinary and exponential generating functions of certain classes of Laguerre polynomials.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
By applying the classic telescoping summation formula and its variants to identities involving inverse hyperbolic tangent functions having inverse powers of the golden ratio as arguments and employing subtle properties of the Fibonacci and…
Lucas polynomials are polynomials in $s_1$ and $s_2$ defined recursively by $\{0\}=0$, $\{1\}=1$, and $\{m\}=s_1\{m-1\}+s_2\{m-2\}$ for $m \geq 2$. We generalize Lucas polynomials from 2-variable polynomials to multivariable polynomials.…
In a recent paper, Yu. A. Brychkov derived a series of identities for multiples sums of special functions, using generating functions. Among these identities, a particularly interesting one involves multiples sums of Bessel $I_{\nu}$…
We prove new theorems for the polynomial expansions of $x^n \pm y^n$ in terms of the binary quadratic forms $\alpha x^2 + \beta xy + \alpha y^2 $ and $a x^2 + bxy + a y^2 $. The paper gives new arithmetic differential approach to compute…
Using generalized binomial coefficients with respect to fundamental Lucas sequences we establish congruences that generalize the classical congruence of Wolstenholme and other related stronger congruences.
Identities between Whittaker and modified Bessel functions are derived for particular complex orders. Certain polynomials appear in such identities, which satisfy a fourth order differential equation (not of hypergeometric type), and they…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
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,…
We prove an inverse relation and a family of convolution formulas involving partial Bell polynomials. Known and some presumably new combinatorial identities of convolution type are discussed. Our approach relies on an interesting…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0-1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the…