Chebyshev polynomials of the first and the second kind in n variables z. , Zt , ... , z„ are introduced. The variables z, , z-,..... z„ are the characters of the representations of SL(n + 1, C) corresponding to the fundamental weights. The Chebyshev polynomials are eigenpolynomials of a second order linear partial differential operator which is in fact the radial part of the Laplace-Beltrami op...

with given a, b, t0, t1 and n ≥ 0. This sequence was introduced by Horadam [3] in 1965, and it generalizes many sequences (see [1, 4]). Examples of such sequences are Fibonacci polynomials sequence (Fn(x))n≥0, Lucas polynomials sequence (Ln(x))n≥0, and Pell polynomials sequence (Pn(x))n≥0, when one has a = x, b = t1 = 1, t0 = 0; a = t1 = x, b = 1, t0 = 2; and a = 2x, b = t1 = 1, t0 = 0; respect...

In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method

The main purpose of this article is to present an approximation method of for singular integrodifferential equations with Cauchy kernel in the most general form under the mixed conditions in terms of the second kind Chebyshev polynomials. This method transforms mixed singular integro-differential equations with Cauchy kernel and the given conditions into matrix equation and using the zeroes of ...

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to gi...

Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of some of these results for permutations which avoid 1243 and 2143. Using tools developed to prove these analogues, we give enumerations and generating functions for permutations which avoid 1243, 2143, and certain a...

Riordan matrix methods and properties of generating functions are used to prove that the entries of two Catalan-type Riordan arrays are linked to the Chebyshev polynomials of the first kind. The connections are that the rows of the arrays are used to expand the monomials (1/2) (2x) and (1/2) (4x) in terms of certain Chebyshev polynomials of degree n. In addition, we find new integral representa...