Related papers: Lucas, Fibonacci, and Chebyshev polynomials from m…
In the present article we introduce three new notions which are called Gaussian Mersenne Lucas numbers, Mersenne Lucas polynomials and Gaussian Mersenne Lucas polynomials. We present and prove our exciting properties and results of them…
In this paper, some $k$-Fibonacci and $k$-Lucas with arithmetic indexes sums are derived by using the matrices $R_{a}=\left[ \begin{array}{lr} L_{k,a} & -(-1)^{a} \\ 1 & 0 \end{array}\right]$ and $S_{a}=\frac{1}{2}\left[ \begin{array}{lr}…
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,…
In this paper, we obtain a general expression for the entries of the r. (r is integer) power of a certain n-square complex tridiagonal matrix. In addition, we get the complex factorizations of Fibonacci polynomials, Fibonacci and Pell…
We extend the necessity part of Lucas Lehmer iteration for testing Mersenne prime to all base and uniformly for both generalized Mersenne and Wagstaff numbers(the later correspond to negative base). The role of the quadratic iteration $x…
In this paper, we consider Poisson-Charlier and poly-Cauchy mixed type polynomials and give various identities of those polynomials which are derived from umbral calculus.
We construct linear operators factorizing the three bases of symmetric polynomials: monomial symmetric functions m(x), elementary symmetric polynomials E(x), and Schur functions s(x), into products of univariate polynomials.
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
Approximation theorem is one of the most important aspects of numerical analysis that has evolved over the years with many different approaches. Some of the most popular approximation methods include the Lebesgue approximation theorem, the…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
Some identities of Chebyshev polynomials are deduced from Waring's formula on symmetric functions. In particular, these formulae generalize some recent results of Grabner and Prodinger.
In this paper, we establish several formulae for sums and alternating sums of products of generalized Fibonacci and Lucas numbers. In particular, we recover and extend all results of Z. Cerin and Z. Cerin & G. M. Gianella, more easily.
This paper is concerned with the generalized Euler polynomial matrix $\E^{(\alpha)}(x)$ and the Euler matrix $\E$. Taking into account some properties of Euler polynomials and numbers, we deduce product formulae for $\E^{(\alpha)}(x)$ and…
We compute the characteristic polynomials of affine Cartan, adjacency matrices and Coxeter polynomials of the associated Coxeter system using Chebyshev polynomials. We give explicit factorization of these polynomials as products of…
The main result of the article says that the formal power series equal to the ratio of two neighboring Chebyshev polynomials, after some renormalization, approximates the generating function of the Catalan numbers. We present a proof of…
We investigate an infinite sequence of polynomials of the form: \[a_0T_{n}(x)+a_{1}T_{n-1}(x)+\cdots+a_{m}T_{n-m}(x)\] where $(a_0,a_1,\ldots,a_m)$ is a fixed m-tuple of real numbers, $a_0,a_m\ne0$, $T_i(x)$ are Chebyshev polynomials of the…
We construct admissible polynomial meshes on piecewise polynomial or trigonometric curves of the complex plane, by mapping univariate Chebyshev points. Such meshes can be used for polynomial least-squares, for the extraction of Fekete-like…
Functions like the exponential, Chebyshev polynomials, and monomial symmetric polynomials are preeminent among all special functions. They have simple definitions and can be expressed using easily specified integers like n!. Families of…
We develop a new way of writing the Lame Hamiltonian in Lie-algebraic form. This yields, in a natural way, an explicit formula for both the Lame polynomials and the classical non-meromorphic Lame functions in terms of Chebyshev polynomials…