Let μ be a probability measure on the real line with finite moments of all orders. Suppose the linear span of polynomials is dense in L(μ). Then there exists a sequence {Pn}∞ n=0 of orthogonal polynomials with respect to μ such that Pn is a polynomial of degree n with leading coefficient 1 and the equality (x − αn)Pn(x) = Pn+1(x) + ωnPn−1(x) holds, where αn and ωn are SzegöJacobi parameters. In...

In this paper, we introduce the class of $(\beta,\gamma)$-Chebyshev functions and corresponding points, which can be seen as a family {\it generalized} Chebyshev polynomials points. For functions, prove that they are orthogonal in certain subintervals $[-1,1]$ with respect to weighted arc-cosine measure. particular investigate cases where become polynomials, deriving new results concerning clas...

Faber polynomials corresponding to rational exterior mapping functions of degree (m,m − 1) are studied. It is shown that these polynomials always satisfy an (m + 1)-term recurrence. For the special case m = 2, it is shown that the Faber polynomials can be expressed in terms of the classical Chebyshev polynomials of the first kind. In this case, explicit formulas for the Faber polynomials are de...

The paper presents the automated design of active RC and programmable filters. The approximating function is derived using Chebyshev orthogonal polynomials of the first kind. Optimization is performed using symbolic manipulation of expressions inputted into computer algebra system. The code is in the form of template notebook, and the user should specify the minimal number of numeric values, su...

Abstract. A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on n letters avoiding (1, 2, 3) and a layered permutation on k letters. In the most interesting case of two layers, the generating function depends onl...

We obtain explicit formulas for the entries of the inverse of a nonsingular and irreducible tridiagonal k−Toeplitz matrix A. The proof is based on results from the theory of orthogonal polynomials and it is shown that the entries of the inverse of such a matrix are given in terms of Chebyshev polynomials of the second kind. We also compute the characteristic polynomial of A which enable us to s...

A permutation is said to be alternating if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on n letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on k letters. In several interesting cases the generating function depends only on k and i...

In this paper‎, ‎first‎, ‎a numerical method is presented for solving a class of linear Fredholm integro-differential equation‎. ‎The operational matrix of derivative is obtained by introducing hybrid third kind Chebyshev polynomials and Block-pulse functions‎. ‎The application of the proposed operational matrix with tau method is then utilized to transform the integro-differential equations to...

We construct an orthogonal wavelet basis for the interval using a linear combination of Legendre polynomials. The coefficients are taken as appropriate roots of Chebyshev polynomials of the second kind. The one-dimensional transform is applied to analytical data and appropriate definitions of a scalogram as well as local and global spectra are presented. The transform is then extended to the mu...